On Minimum k-Modal Partitions of Permutations

DOI10.1007/11682462_36zbMath1145.90435OpenAlexW1530203266MaRDI QIDQ3525774

Marco E. Lübbecke, Gabriele Di Stefano, Stefan Krause, Uwe T. Zimmermann

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_36

zbMATH Keywords

approximation algorithmonline algorithmmonotone sequenceLP roundingmixed integer program\(\mathcal {NP}\)-hardnesscocoloring\(k\)-modal sequence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

A tutorial on the use of graph coloring for some problems in robotics ⋮ Unnamed Item ⋮ On minimum \(k\)-modal partitions of permutations

This page was built for publication: On Minimum k-Modal Partitions of Permutations