Title of article

Complexity of min–max subsequence problems

Author/Authors

Wil Michiels، نويسنده , , Jan Korst، نويسنده ,

Issue Information

دوهفته نامه با شماره پیاپی سال 2003

Pages

5

From page

213

To page

217

Keywords

polynomial-time approximation scheme , computational complexity , Min–max subsequence problem

Journal title

Information Processing Letters

Serial Year

2003

Journal title

Information Processing Letters

Record number

129765