Polynomial time approximation schemes for Euclidean TSP and other geometric problems

Sanjeev Arora
Proc. 37th Symp. Foundations of Computer Science, IEEE, Oct 1996, pp. 2–11
J. ACM 45(5):753–782, Sep 1998

Cites:

[D. Eppstein publications] [Citation database] [Documents]
Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!