Unconstrained traveling tournament problem is APX-complete

DOI10.1016/j.orl.2023.06.006zbMath1525.90413arXiv2212.09165MaRDI QIDQ6047703

Salomon Bendayan, Joseph Cheriyan, Kevin K. H. Cheung

Publication date: 12 September 2023

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

Full work available at URL: https://arxiv.org/abs/2212.09165

zbMATH Keywords

traveling salesman problemapproximation algorithmsAPX-completetraveling tournament problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• A 2.75-approximation algorithm for the unconstrained traveling tournament problem
• Complexity of the traveling tournament problem
• Complexity of the unconstrained traveling tournament problem
• TSP with bounded metrics
• The Design of Approximation Algorithms
• The Traveling Salesman Problem with Distances One and Two

This page was built for publication: Unconstrained traveling tournament problem is APX-complete