THE SINGLE FACILITY LOCATION PROBLEM WITH MINIMUM DISTANCE CONSTRAINTS.

[1]  Richard Cole,et al.  Slowing down sorting networks to obtain faster sorting algorithms , 2015, JACM.

[2]  G. O. Wesolowsky,et al.  The rectilinear distance minisum problem with minimum distance constraints , 1995 .

[3]  Horst W. Hamacher,et al.  Restricted planar location problems and applications , 1995 .

[4]  Emanuel Melachrinoudis,et al.  An O(mn2) algorithm for the Maximin problem in E2 , 1995, Oper. Res. Lett..

[5]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[6]  H. Hamacher,et al.  Combinatorial algorithms for some 1-facility median problems in the plane , 1994 .

[7]  Mahmut Parlar,et al.  Technical Note - Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel , 1994, Transp. Sci..

[8]  C. Pandu Rangan,et al.  An O(n log n) algorithm for a maxmin location problem , 1992, Discret. Appl. Math..

[9]  Siu-Wing Cheng,et al.  Efficient maintenance of the union intervals on a line, with applications , 1991, SODA '90.

[10]  Arie Tamir,et al.  Algebraic optimization: The Fermat-Weber location problem , 1990, Math. Program..

[11]  John Hershberger,et al.  Finding the Upper Envelope of n Line Segments in O(n log n) Time , 1989, Inf. Process. Lett..

[12]  Erhan Erkut,et al.  Analytical models for locating undesirable facilities , 1989 .

[13]  Franz Aurenhammer,et al.  Improved Algorithms for Discs and Balls Using Power Diagrams , 1988, J. Algorithms.

[14]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

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

[16]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[17]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[18]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[19]  Elmar Schömer,et al.  Subquadratic algorithms for the weighted maximin facility location problem , 1995, CCCG.

[20]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .