The single facility location problem with minimum distance constraints

Aho, 1974

Aneja, 1994, Algorithms for the Weber facility location in the presence of forbidden regions and/or barriers to travel, Transportation Science, 28, 70, 10.1287/trsc.28.1.70

Aurenhammer, 1988, Improved algorithms for discs and balls using power diagrams, Journal of Algorithms, 9, 151, 10.1016/0196-6774(88)90035-1

Cheng, 1991, Efficient maintenance of the union of intervals on a line, with applications, Journal of Algorithms, 12, 57, 10.1016/0196-6774(91)90023-R

Cole, 1987, Slowing down sorting networks to obtain faster sorting algorithms, J. ACM., 34, 200, 10.1145/7531.7537

Dyer, 1986, On a multidimensional search procedure and its application to the Euclidean one-centre problem, SIAM Journal on Computing, 15, 725, 10.1137/0215052

Hamacher, 1995, Restricted planar location problems and applications, Naval Research Logistics, 42, 967, 10.1002/1520-6750(199509)42:6<967::AID-NAV3220420608>3.0.CO;2-X

Hershberger, 1989, Finding the upper envelope of n line segments in O(n log n) time, Information Processing Letters, 33, 169, 10.1016/0020-0190(89)90136-1

Megiddo, 1983, Linear-time algorithms for linear programming in R3 and related problems, SIAM Journal on Computing, 12, 759, 10.1137/0212052

Megiddo, 1983, Applying parallel computation algorithms in the design of serial algorithms, Journal of ACM, 30, 852, 10.1145/2157.322410

Melachrinoudis, 1995, An O(mn2) algorithm for the maximin problem in E2, Operations Research Letters, 18, 25, 10.1016/0167-6377(95)00025-F

Nickel, 1995

Ranagan, 1992, An O(n log n) algorithm for a maxmin location problem, Discrete Applied Mathematics, 36, 203, 10.1016/0166-218X(92)90234-2

Sharir, 1995

Valiant, 1975, Parallelism in comparison problems, SIAM Journal on Computing, 4, 348, 10.1137/0204030