Complexity of min-max subsequence problems

DOI10.1016/S0020-0190(03)00272-2zbMath1161.68485OpenAlexW2065168530MaRDI QIDQ1014423

Wil Michiels, Jan H. M. Korst

Publication date: 28 April 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00272-2

zbMATH Keywords

computational complexitypolynomial-time approximation schememin-max subsequence problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Cyclic scheduling of offweekends
• Approximation schemes for scheduling on parallel machines
• Some complexity results about threshold graphs
• Integer Programming with a Fixed Number of Variables
• Min-max subsequence problems in multi-zone disk recording

This page was built for publication: Complexity of min-max subsequence problems