Approximation algorithms for facility location with capacitated and length-bounded tree connections
DOI10.1007/978-3-642-40450-4_60zbMATH Open1395.90173OpenAlexW2183749647MaRDI QIDQ2849359FDOQ2849359
Authors: Jannik Matuschke, Andreas Bley, Benjamin Müller 
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
Recommendations
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- Approximation algorithms for connected facility location problems
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
- Improved Approximation Algorithm for Connected Facility Location Problems
- Approximation algorithms for a facility location problem with service capacities
Approximation algorithms (68W25) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Cited In (9)
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
- Title not available (Why is that?)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center
- Title not available (Why is that?)
- The general facility location problem with connectivity on trees
- Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
- Approximate the lower-bounded connected facility location problem
This page was built for publication: Approximation algorithms for facility location with capacitated and length-bounded tree connections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849359)
