direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments


Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections
Zitatschlüssel Report-013-2013
Autor Matuschke, Jannik and Bley, Andreas and Müller, Benjamin
Jahr 2013
Nummer 13
Institution Institut für Mathematik, TU Berlin
Zusammenfassung We consider a generalization of the uncapacitated facility location problem that occurs in planning of optical access networks in telecommunications. Clients are connected to open facilities via depth-bounded trees. The total demand of clients served by a tree must not exceed a given tree capacity. We investigate a framework for combining facility location algorithms with a tree-based clustering approach and derive approximation algorithms for several variants of the problem, using techniques for approximating shallow-light Steiner trees via layer graphs, simultaneous approximation of shortest paths and minimum spanning trees, and greedy coverings.
Typ der Publikation Preprint
Link zur Publikation Download Bibtex Eintrag