Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
From MaRDI portal
Publication:3638044
DOI10.1007/978-3-642-02927-1_27zbMath1248.68555OpenAlexW1520984708MaRDI QIDQ3638044
Ken-ichi Kawarabayashi, Erik D. Demaine, Mohammad Taghi Hajiaghayi
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_27
Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (7)
Layered separators in minor-closed graph classes with applications ⋮ The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs ⋮ Additive non-approximability of chromatic number in proper minor-closed classes ⋮ Parameterized complexity of the spanning tree congestion problem ⋮ Additive non-approximability of chromatic number in proper minor-closed classes ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
