Abstract
We show that the Unconstrained Traveling Tournament Problem (UTTP) is APX-complete by giving an L-reduction from the following version of (1,2)-TSP: Our analysis gives an inapproximability threshold of 1+((α−1)/200) for UTTP, where α denotes the inapproximability threshold for (1,2)-TSP.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
