5 search results - page 1 / 1 » Approximate TSP in Graphs with Forbidden Minors |
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
ICALP
2009
Springer
14 years 4 months 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...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...