TY - CONF A1 - Matuschke, Jannik A1 - Bley, Andreas A1 - Müller, Benjamin A2 - Bodlaender, Hans L. A2 - Italiano, Giuseppe F. T1 - Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections N2 - 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. Y1 - 2013 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/5268 VL - Algorithms -- ESA 2013 SP - 707 EP - 718 PB - Springer ER -