On the maximum scatter TSP

Authors:
Esther M. Arkin;Yi-Jen Chiang;Joseph S. B. Mitchell;Steven S. Skiena;Tae-Cheon Yang
Affiliations:
Department of Applied Mathematics and Statistics, SUNY, Stony Brook, NY;Department of Applied Mathematics and Statistics, SUNY, Stony Brook, NY;Department of Applied Mathematics and Statistics, SUNY, Stony Brook, NY;Department of Computer Science, SUNY Stony Brook, NY;Dept. of Computer Science and Statistics, Kyungsung University, 110, DaeYeon-dong, Nam-gu, Pusan, 608-736, Korea
Venue:
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Year:
1997

Long non-crossing configurations in the plane

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Two algorithmic results for the traveling salesman problem

Mathematics of Operations Research

Simplicity and hardness of the maximum traveling salesman problem under geometric distances

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
The geometric maximum traveling salesman problem

Journal of the ACM (JACM)
Traveling salesman problem of segments

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Hi-index	0.01