loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
A linear-time approximation scheme for planar weighted TSP
Pittsburgh, Pennsylvania, USA
October 23-October 25
ISBN: 0-7695-2468-0
ASCII Text
x 
 
Philip N. Klein, "A linear-time approximation scheme for planar weighted TSP," Foundations of Computer Science, IEEE Annual Symposium on, pp. 647-657, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/SFCS.2005.7,
author = {Philip N. Klein},
title = {A linear-time approximation scheme for planar weighted TSP},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {2005},
isbn = {0-7695-2468-0},
pages = {647-657},
doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.7},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - A linear-time approximation scheme for planar weighted TSP
SN - 0-7695-2468-0
SP647
EP657
A1 - Philip N. Klein,
PY - 2005
KW - null
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
Philip N. Klein, Brown University

We give an algorithm requiring O(c^{1/ \in ^2 }) time to find an \in -optimal traveling salesman tour in the metric defined by a planar graph with nonnegative edge-lengths.

Citation:
Philip N. Klein, "A linear-time approximation scheme for planar weighted TSP," focs, pp.647-657, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.