New Orleans, Louisiana, USA
a simple new method for the geometric k-MST problem, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p
Skiena Steven S
Arkin Esther M
January , 05-07 algorithms p211-220
The geometric maximum traveling salesman problem
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems