Proc. 38th Symp. Foundations of Computer Science
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems, Aro-FOCS-97
Improved bounds for planar $k$-sets and related problems, Dey-FOCS-97
[
D. Eppstein publications
] [
Citation database
] [
Locations
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
