Finding Longest Geometric Tours

Sándor P. Fekete ()
Additional contact information
Sándor P. Fekete: Technische Universität Braunschweig, Department Informatik

A chapter in Gems of Combinatorial Optimization and Graph Algorithms, 2015, pp 29-36 from Springer

Abstract: Abstract We discuss the problem of finding a longest tour for a set of points in a geometric space. In particular, we show that a longest tour for a set of n points in the plane can be computed in time O(n) if distances are determined by the Manhattan metric, while the same problem is NP-hard for points on a sphere under Euclidean distances.

Keywords: Edge Weight; Travel Salesman Problem; Travel Salesman Problem; Hamiltonian Cycle; Maximum Match (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-24971-1_3

Ordering information: This item can be ordered from
http://www.springer.com/9783319249711

DOI: 10.1007/978-3-319-24971-1_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().