Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections

DOI10.1007/978-3-642-40450-4_60zbMath1395.90173OpenAlexW2183749647MaRDI QIDQ2849359

Benjamin Müller, Jannik Matuschke, Andreas Bley

Publication date: 17 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_60

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items

Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center ⋮ Unnamed Item