The Maximum Traveling Salesman Problem Under Polyhedral Norms
暂无分享,去创建一个
Gerhard J. Woeginger | David S. Johnson | Alexander Barvinok | Russell Woodroofe | David S. Johnson | G. Woeginger | A. Barvinok | R. Woodroofe
[1] S. S. Sengupta,et al. The traveling salesman problem , 1961 .
[2] Alexander I. Barvinok,et al. Two Algorithmic Results for the Traveling Salesman Problem , 1996, Math. Oper. Res..
[3] Jayme Luiz Szwarcfiter,et al. Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..
[4] Sanjeev Arora,et al. Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[5] Luca Trevisan,et al. When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract) , 1997, STOC '97.
[6] Mihalis Yannakakis,et al. The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..
[7] Joseph S. B. Mitchell,et al. Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..
[8] Joseph S. B. Mitchell,et al. Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem , 1996, SODA '96.
[9] Eitan Zemel,et al. An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems , 1984, Inf. Process. Lett..
[10] Charles U. Martel,et al. Fast Algorithms for Bipartite Network Flow , 1987, SIAM J. Comput..
[11] Nimrod Megiddo,et al. Linear time algorithms for some separable quadratic programming problems , 1993, Oper. Res. Lett..
[12] Sanjeev Arora,et al. Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.