Sciweavers

4277 search results - page 38 / 856
» On Multiple Linear Approximations
Sort
View
SIAMCOMP
2008
77views more  SIAMCOMP 2008»
13 years 7 months ago
A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
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...
Philip N. Klein
IPL
2007
70views more  IPL 2007»
13 years 7 months ago
An improved approximation ratio for the minimum linear arrangement problem
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...
Uriel Feige, James R. Lee