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. © 2013 Springer-Verlag.
CITATION STYLE
Matuschke, J., Bley, A., & Müller, B. (2013). Approximation algorithms for facility location with capacitated and length-bounded tree connections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8125 LNCS, pp. 707–718). https://doi.org/10.1007/978-3-642-40450-4_60
Mendeley helps you to discover research relevant for your work.