Author:
Barvinok Alexander,Johnson David S.,Woeginger Gerhard J.,Woodroofe Russell
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. S. Arora. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. Proc. 37th IEEE Symp. on Foundations of Computer Science, pages 2–12. IEEE Computer Society, Los Alamitos, CA, 1996.
2. S. Arora. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. Proc. 38th IEEE Symp. on Foundations of Computer Science, pages 554–563. IEEE Computer Society, Los Alamitos, CA, 1997.
3. A. I. Barvinok. Two algorithmic results for the traveling salesman problem. Math. of Oper. Res., 21:65–84, 1996.
4. D. Gusfield, C. Martel, and D. Fernandez-Baca. Fast algorithms for bipartite network flow. SIAM J. Comput., 16:237–251, 1987.
5. A. Itai, C. Papadimitriou, and J. L. Swarcfiter. Hamilton paths in grid graphs. SIAM J. Comput., 11:676–686, 1982.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions;Computational Optimization and Applications;2017-08-12
2. A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem;Integer Programming and Combinatorial Optimization;2017
3. Speedup Graph Processing by Graph Ordering;Proceedings of the 2016 International Conference on Management of Data;2016-06-26
4. Finding Longest Geometric Tours;Gems of Combinatorial Optimization and Graph Algorithms;2015
5. Max-Plus Algebra;Discrete Mathematics and Its Applications;2013-11-26