Abstract
The T-tour problem is a natural generalization of TSP and Path TSP. Given a graph G=(V,E), edge cost c:E→R≥0, and an even cardinality set T⊆V, we want to compute a minimum-cost T-join connecting all vertices of G (and possibly containing parallel edges).In this paper we give an 117-approximation for the T-tour problem and show that the integrality ratio of the standard LP relaxation is at most 117. Despite much progress for the special case Path TSP, for general T-tours this is the first improvement on Sebő’s analysis of the Best-of-Many-Christofides algorithm (Sebő, 2013).
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.
