Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections
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.
Unable to display preview. Download preview PDF.
- 3.Byrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: An improved LP-based approximation for Steiner tree. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 583–592 (2010)Google Scholar
- 12.Maßberg, J., Vygen, J.: Approximation algorithms for a facility location problem with service capacities. ACM Transactions on Algorithms (TALG) 4(4), 50 (2008)Google Scholar