Iterative Compression for Exactly Solving NP-Hard Minimization Problems

DOI10.1007/978-3-642-02094-0_4zbMath1248.68380MaRDI QIDQ3637312

Rolf Niedermeier, Jiong Guo, Hannes Moser

Publication date: 9 July 2009

Published in: Algorithmics of Large and Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02094-0_4

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

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

05C85: Graph algorithms (graph-theoretic aspects)