摘要:
warwick.ac.uk参考文章(17)
Sanjeev Arora, Approximation schemes for NP-hard geometric optimization problems: a survey Mathematical Programming. ,vol. 97, pp. 43- 69 ,(2003) , 10.1007/S10107-003-0438-Y
David Eppstein, Marshall Bern, Approximation algorithms for geometric problems Approximation algorithms for NP-hard problems. pp. 296- 345 ,(1996)
André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao, Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs Algorithms – ESA 2005. ,vol. 3669, pp. 472- 483 ,(2005) , 10.1007/11561071_43
Sanjeev Arora, Prabhakar Raghavan, Satish Rao, Approximation schemes for Euclidean k-medians and related problems symposium on the theory of computing. pp. 106- 113 ,(1998) , 10.1145/276698.276718
Dorit S. Hochba, Approximation Algorithms for NP-Hard Problems ,(1996)
Sanjeev Arora, George Karakostas, Approximation Schemes for Minimum Latency Problems SIAM Journal on Computing. ,vol. 32, pp. 1317- 1337 ,(2003) , 10.1137/S0097539701399654
Joseph S. B. Mitchell, Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k -MST, and Related Problems SIAM Journal on Computing. ,vol. 28, pp. 1298- 1309 ,(1999) , 10.1137/S0097539796309764
Luca Trevisan, When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree SIAM Journal on Computing. ,vol. 30, pp. 475- 485 ,(2000) , 10.1137/S0097539799352735
Artur Czumaj, Andrzej Lingas, On approximability of the minimum-cost k-connected spanning subgraph problem symposium on discrete algorithms. pp. 281- 290 ,(1999)
Christos H. Papadimitriou, The Euclidean travelling salesman problem is NP-complete Theoretical Computer Science. ,vol. 4, pp. 237- 244 ,(1977) , 10.1016/0304-3975(77)90012-3