A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
[chapter]
2009
Lecture Notes in Computer Science
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for coloring within 2 of the optimal chromatic number, which is essentially best possible, and generalizes the seminal result by Thomassen [32] for bounded-genus graphs. This result also improves our understanding from an algorithmic point of view of the venerable Hadwiger conjecture about coloring H-minor-free graphs. The
doi:10.1007/978-3-642-02927-1_27
fatcat:en2uxhqyxraznbrc4cyucem64e