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

DOI10.1016/J.ORL.2010.03.007zbMath1193.90181OpenAlexW1997786488MaRDI QIDQ991472

Stefan Steinerberger

Publication date: 7 September 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.03.007

zbMATH Keywords

traveling salesman problemdiscrepancyuniform distribution

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

Random restricted matching and lower bounds for combinatorial optimization ⋮ Randomized near-neighbor graphs, giant components and applications in data science ⋮ Bounds for the traveling salesman paths of two-dimensional modular lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequences, discrepancies and applications
• Shortest Paths Through Pseudo-Random Points in the d-Cube

This page was built for publication: A new lower bound for the geometric traveling salesman problem in terms of discrepancy