Optimal Facility Location under Various Distance Functions
暂无分享,去创建一个
Sergey Bereg | Michael Segal | Klara Kedem | K. Kedem | M. Segal | S. Bereg
[1] Bernard Chazelle. Filtering Search: A New Approach to Query-Answering , 1983, FOCS.
[2] Elmar Schömer,et al. Subquadratic algorithms for the weighted maximin facility location problem , 1995, CCCG.
[3] Nimrod Megiddo,et al. New Results on the Complexity of p-Center Problems , 1983, SIAM J. Comput..
[4] Prof. Dr. Kurt Mehlhorn,et al. Data Structures and Algorithms 3 , 2012, EATCS Monographs on Theoretical Computer Science.
[5] Franco P. Preparata,et al. New Parallel-Sorting Schemes , 1978, IEEE Transactions on Computers.
[6] Franz Aurenhammer,et al. An optimal algorithm for constructing the weighted voronoi diagram in the plane , 1984, Pattern Recognit..
[7] C. Bajaj. Geometric Optimization and Computational Complexity , 1984 .
[8] Kurt Mehlhorn,et al. Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.
[9] 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).
[10] Richard Cole,et al. Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms , 1987, FOCS.
[11] Hossam ElGindy,et al. Efficient Algorithms for the Capacitated 1-Median Problem , 1992, INFORMS J. Comput..
[12] E WillardDan,et al. Adding range restriction capability to dynamic data structures , 1985 .
[13] George S. Lueker,et al. Adding range restriction capability to dynamic data structures , 1985, JACM.
[14] Chanderjit Bajaj. Geometric optimization and computational complexity (algebra, algorithms, robotics) , 1984 .
[15] Bernard Chazelle,et al. A Functional Approach to Data Structures and Its Use in Multidimensional Searching , 1988, SIAM J. Comput..