Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
Sanjeev Arora
Proc. 38th Symp. Foundations of Computer Science
,
IEEE
,
Oct 1997, pp. 554–563
Cites:
Approximation algorithms for geometric problems
Parallel construction of quadtrees and quality triangulations
Iterated nearest neighbors and finding minimal polytopes
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
