Author:
Gottschalk Corinna,Vygen Jens
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference22 articles.
1. An, H.-C., Kleinberg, R., Shmoys, D.B.: Improving Christofides’ algorithm for the $$s$$ s – $$t$$ t path TSP. J. ACM 62, 34 (2015)
2. Asadpour, A., Goemans, M.X., Mądry, A., Oveis Gharan, S., Saberi, A. : An $$O(\log n/\log \log n)$$ O ( log n / log log n ) -approximation algorithm for the asymmetric traveling salesman problem. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 379–389 (2010)
3. Cheriyan, J., Friggstad, Z., Gao, Z.: Approximating minimum-cost connected $$T$$ T -joins. Algorithmica 72, 126–147 (2015)
4. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh (1976)
5. Cunningham, W.H.: Testing membership in matroid polyhedra. J. Comb. Theory B 36, 161–188 (1984)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献