论文信息 - A simple heuristic for the p-centre problem - 字舞流文

A simple heuristic for the p-centre problem

A. Frieze | M. Dyer

[1] George L. Nemhauser,et al. Easy and hard bottleneck location problems , 1979, Discret. Appl. Math..

[2] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[3] T. Ibaraki,et al. The Computational Complexity of the m -Center Problems on the Plane , 1981 .

[4] Robert J. Fowler,et al. Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[5] Zvi Drezner,et al. The p-Centre Problem—Heuristic and Optimal Algorithms , 1984 .

[6] David B. Shmoys,et al. Powers of graphs: A powerful approximation technique for bottleneck problems , 1984, STOC '84.

[7] Nimrod Megiddo,et al. On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[8] Martin E. Dyer,et al. On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem , 1986, SIAM J. Comput..