English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Approximation algorithms for bounded facility location

MPS-Authors
/persons/resource/persons44853

Krysta,  Piotr
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45136

Solis-Oba,  Roberto
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Krysta, P., & Solis-Oba, R. (1999). Approximation algorithms for bounded facility location. In T. Asano, H. Imai, D. T. Lee, S. Nakano, & T. Tokuyama (Eds.), Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99) (pp. 241-250). Berlin: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-35A2-D
Abstract
The bounded $k$-median problem is to select in an undirected graph $G=(V,E) $ a set $S$ of $k$ vertices such that the maximum distance from a vertex $v \in V$ to $S$ is at mos t a given bound $d$ and the average distance from vertices $V$ to $S$ is minimized. We present random ized algorithms for several versions of this problem. We also study the bounded version of the uncapacitated facility location problem. For this latter problem we present extensions of known deterministic algorithms for the unbounded version, a nd we prove some inapproximability results.