COMBINATORICA
2008
14 years 12 days ago
2008
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an (w)
STACS
2009
Springer
14 years 7 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
ICALP
2009
Springer
15 years 18 days ago
2009
Springer
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 colorin...