Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference12 articles.
1. Bläser, M.: An 8/13-approximation algorithm for the asymmetric maximum TSP. J. Algorithms 50(1), 23–48 (2004)
2. Bläser, M.: A 3/4-approximation algorithm for maximum ATSP with weights zero and one. APPROX-RANDOM. In: Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 8th International Workshop on Randomization and Computation, vol. 3122 of Lecture Notes in Computer Science, pp. 61–71. Springer (2004)
3. Bläser, M., Siebert, B.: Computing cycle covers without short cycles. In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computing Science, vol. 2161, pp 369–379, Springer (2001)
4. Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation algorithms for asymmetric tsp by decomposing directed regular multigraphs. J. ACM 52(4), 602–626 (2005). Preliminary version appeared in FOCS’03
5. Karpinski, M., Schmied, R.: Improved inapproximability results for the shortest superstring and related problems. In: Proceedings of Nineteenth Computing: The Australasian Theory Symposium, CATS 2013, vol. 141 of CRPIT, pp. 27–36. Australian Computer Society (2013)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献