2 search results - page 1 / 1 » A Linear-Time Approximation Scheme for TSP in Undirected Pla... |
117
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
138
Voted
FOCS
2009
IEEE
15 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...