Optimal Facility Location under Various Distance Functions

Authors:
Sergei Bespamyatnikh;Klara Kedem;Michael Segal
Affiliations:
-;-;-
Venue:
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Year:
1999

Citing 8
Cited 0

Data structures and algorithms 3: multi-dimensional searching and computational geometry

Data structures and algorithms 3: multi-dimensional searching and computational geometry
Adding range restriction capability to dynamic data structures

Journal of the ACM (JACM)
Filtering search: a new approach to query answering

SIAM Journal on Computing
Functional approach to data structures and its use in multidimensional searching

SIAM Journal on Computing
Cascading divide-and-conquer: a technique for designing parallel algorithms

SIAM Journal on Computing
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Geometric optimization and computational complexity (algebra, algorithms, robotics)

Geometric optimization and computational complexity (algebra, algorithms, robotics)
New Parallel-Sorting Schemes

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present efficient algorithms for two problems of facility location. In both problems we want to determine the location of a single facility with respect to n given sites. In the first we seek a location that maximizesa weighted distance function between the facility and the sites, and in the second we find a location that minimizes the sum (or sum of the squares) of the distances of k of the sites from the facility.