Approximation algorithms via structural results for apex-minor-free graphs
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 Th...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Springer Berlin/Heidelberg
2011
|
| Online Access: | http://hdl.handle.net/1721.1/62243 https://orcid.org/0000-0003-3803-5703 |