On minimum \(k\)-modal partitions of permutations
From MaRDI portal
Publication:1018088
DOI10.1016/j.jda.2008.01.002zbMath1173.90482MaRDI QIDQ1018088
Gabriele Di Stefano, Marco E. Lübbecke, Stefan Krause, Uwe T. Zimmermann
Publication date: 13 May 2009
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2008.01.002
approximation algorithm; coloring; online algorithm; monotone sequence; LP rounding; mixed integer program; \(\mathcal{NP}\)-hardness; cocoloring; \(k\)-modal sequence
68Q25: Analysis of algorithms and problem complexity
90C11: Mixed integer programming
05A05: Permutations, words, matrices
90C27: Combinatorial optimization