On the Complexity of Some Common Geometric Location Problems
暂无分享,去创建一个
[1] K. Nair,et al. Optimal location of a single service center of certain types , 1971 .
[2] D. Hearn,et al. Geometrical Solutions for Some Minimax Location Problems , 1972 .
[3] Ronald L. Graham,et al. Some NP-complete geometric problems , 1976, STOC '76.
[4] Christos H. Papadimitriou,et al. The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] S. L. HAKIMIt. AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .
[7] Christos H. Papadimitriou,et al. Worst-Case and Probabilistic Analysis of a Geometric Location Problem , 1981, SIAM J. Comput..
[8] Nimrod Megiddo,et al. An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems , 1981, SIAM J. Comput..
[9] Kenneth Jay Supowit,et al. Topics in Computational Geometry , 1981 .
[10] N. Megiddo,et al. The Maximum Coverage Location Problem , 1983 .