Author:
Chlebík Miroslav,Chlebíková Janka
Publisher
Springer International Publishing
Reference16 articles.
1. Lecture Notes in Computer Science;H-J Böckenhauer,2000
2. Lecture Notes in Computer Science;M Chlebík,2003
3. Chlebík, M., Chlebíková, J.: The Steiner tree problem on graphs: inapproximability results. Theor. Comput. Sci. 406, 207–214 (2008)
4. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem, Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh PA (1976)
5. Engebretsen, L.: An explicit lower bound for TSP with distances one and two. Algorithmica 35(4), 301–319 (2003). Preliminary version in STACS 1999
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献