OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
From MaRDI portal
Publication:4762912
DOI10.1142/S0218195900000292zbMath0985.90062MaRDI QIDQ4762912
Arie Tamir, Michael Segal, Klara Kedem, Sergei Bespamyatnikh
Publication date: 2 June 2002
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)
Related Items
Extensions to the Weber problem, Sorting weighted distances with applications to objective function evaluations in single facility location problems., Finding an Euclidean anti-\(k\)-centrum location of a set of points, Low complexity algorithms for optimal consumer push-pull partial covering in the plane, Locating two obnoxious facilities using the weighted maximin criterion, Algorithmic results for ordered median problems
Cites Work
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- New Results on the Complexity of p-Centre Problems
- Filtering Search: A New Approach to Query-Answering
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Adding range restriction capability to dynamic data structures
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Efficient Algorithms for the Capacitated 1-Median Problem
- New Parallel-Sorting Schemes
- The single facility location problem with minimum distance constraints
- Slowing down sorting networks to obtain faster sorting algorithms
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
