Covering a set of points with a minimum number of turns

International Journal of Computational Geometry and Applications

Volumn 14, Issue 1-2, 2004, Pages 105-114

  Collins, Michael J ^a,b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b MSC01 1070   (United States)

Author keywords

Bends; Link length; Rectilinear; TSP; Turns

Indexed keywords

EID: 7444270315     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/s021819590400138x     Document Type: Conference Paper

References (5)

1. E. Arkin, M. A. Bender, E. Demaine, S. P. Fekete, J. S. B. Mitchell and S. Sethia, Optimal covering tours with turn costs, in Proc. 12th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA) (2001), pp. 138-147.
2. C. Stein and D. P. Wagner, Approximation algorithms for the minimum bends traveling salesman problem, in Proc. IPCO 2001, LNCS 2081, pp. 406-419.
3. M. Collins and B. Moret, Improved lower bounds for the link length of rectilinear spanning paths in grids, Inform. Process. Lett. 68 (1998) 317-319.
4. E. Kranakis, D. Krizanc and L. Meertens, Link length of rectilinear hamiltonian tours on grids, Ars Combinatoria 38 (1994) 177-193.
5. R. Fourer, D. M. Gay and B. W. Kernighan, AMPL: A Modeling Language for Mathematical Programming (Boyd and Fraser, Danvers, MA, 1993).