Approximating Minimum-Cost Connected T-Joins-Reference-Cited by-同舟云学术

Approximating Minimum-Cost Connected T-Joins

Published:2013-11-16 Issue:1 Volume:72 Page:126-147
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Cheriyan Joseph,Friggstad Zachary,Gao Zhihan

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-013-9850-8.pdf

Reference20 articles.

1. An, H.-C., Kleinberg, R., Shmoys, D.B.: Improving Christofides’ algorithm for the s-t path TSP. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing, pp. 875–886 (2012). CoRR arXiv:1110.4604v2 (2011)

2. Archer, A., Bateni, M., Hajiaghayi, M., Karloff, H.J.: Improved approximation algorithms for prize-collecting Steiner tree and TSP. SIAM J. Comput. 40(2), 309–332 (2011)

3. Balas, E.: The prize-collecting traveling salesman problem. Networks 19(6), 621–636 (1989)

4. Barahona, F., Conforti, M.: A construction for binary matroids. Discrete Math. 66(3), 213–218 (1987)

5. Chaudhuri, K., Godfrey, B., Rao, S., Talwar, K.: Paths, trees, and minimum latency tours. In: Proceedings of the 44nd Annual IEEE Symposium on Foundations of Computer Science, pp. 36–45 (2003)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond;Mathematics of Operations Research;2023-10-13

2. Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center;Algorithmica;2022-12-20

3. Reducing Path TSP to TSP;SIAM Journal on Computing;2021-10-18

4. Improving on Best-of-Many-Christofides for T-tours;Operations Research Letters;2020-11

5. Reducing path TSP to TSP;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06