de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Approximation algorithms for bounded facility location

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44853

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45136

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

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

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.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-35A2-D
Zusammenfassung
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.