Approximating Minimum-Cost Connected T-Joins

@article{Cheriyan2013ApproximatingMC,
  title={Approximating Minimum-Cost Connected T-Joins},
  author={J. Cheriyan and Zachary Friggstad and Zhihan Gao},
  journal={Algorithmica},
  year={2013},
  volume={72},
  pages={126-147}
}
  • J. Cheriyan, Zachary Friggstad, Zhihan Gao
  • Published 2013
  • Mathematics, Computer Science
  • Algorithmica
  • We design and analyse approximation algorithms for the minimum-cost connectedT-join problem: given an undirected graph G=(V,E) with nonnegative costs on the edges, and a set of nodes T⊆V, find (if it exists) a spanning connected subgraph H of minimum cost such that every node in T has odd degree and every node not in T has even degree; H may have multiple copies of any edge of G. Two well-known special cases are the TSP (T=∅) and the s,t path TSP (T={s,t}). Recently, An et al. (Proceedings of… CONTINUE READING
    11 Citations
    Eight-Fifth approximation for the path TSP
    • A. Sebő
    • Mathematics, Computer Science
    • IPCO 2013
    • 2013
    • 34
    • PDF
    Eight-Fifth Approximation for the Path TSP
    • 33
    • Highly Influenced
    • PDF
    Improving on Best-of-Many-Christofides for T-tours
    • Vera Traub
    • Mathematics, Computer Science
    • Oper. Res. Lett.
    • 2020
    • PDF
    Better s–t-tours by Gao trees
    • 5
    Minimum T-Joins and Signed-Circuit Covering
    • 2
    • PDF
    On the Metric s-t Path Traveling Salesman Problem
    • Zhihan Gao
    • Mathematics, Computer Science
    • SIAM J. Discret. Math.
    • 2015
    • 12
    • PDF
    Reassembling Trees for the Traveling Salesman
    • J. Vygen
    • Mathematics, Computer Science
    • SIAM J. Discret. Math.
    • 2016
    • 21
    • Highly Influenced
    • PDF
    An LP-based 32-approximation algorithm for the s-ts-t path graph Traveling Salesman Problem
    • Zhihan Gao
    • Mathematics, Computer Science
    • Oper. Res. Lett.
    • 2013
    • 4
    Ju l 2 01 9 Reducing Path TSP to TSP
    An LP-based 3/2-approximation algorithm for the graphic s-t path TSP
    • 8
    • PDF

    References

    SHOWING 1-10 OF 29 REFERENCES
    Eight-Fifth approximation for the path TSP
    • A. Sebő
    • Mathematics, Computer Science
    • IPCO 2013
    • 2013
    • 34
    • PDF
    Eight-Fifth Approximation for the Path TSP
    • 33
    • Highly Influential
    • PDF
    A Randomized Rounding Approach to the Traveling Salesman Problem
    • 161
    • Highly Influential
    • PDF
    Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
    • 62
    • Highly Influential
    Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP
    • 93
    • PDF
    A general approximation technique for constrained forest problems
    • 887
    • Highly Influential
    • PDF
    Approximating Graphic TSP by Matchings
    • Tobias Mömke, O. Svensson
    • Mathematics, Computer Science
    • 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
    • 2011
    • 120
    • Highly Influential
    • PDF
    Improving Christofides' Algorithm for the s-t Path TSP
    • 52
    • Highly Influential
    • PDF
    Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
    • 1,338