A new lower bound for the geometric traveling salesman problem in terms of discrepancy

✍ Scribed by Stefan Steinerberger

• Publisher: Elsevier Science
• Year: 2010
• Tongue: English
• Weight: 211 KB
• Volume: 38
• Category: Article
• ISSN: 0167-6377
• DOI: 10.1016/j.orl.2010.03.007

✦ Synopsis

We give a new lower bound for the shortest hamiltonian path through n points of [0, 1] d in terms of the discrepancy of these n points. This improves an earlier result by Steele.