Approximation algorithms for facility location with capacitated and length-bounded tree connections
From MaRDI portal
Publication:2849359
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
Cited in
(9)- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
- scientific article; zbMATH DE number 7765379 (Why is no real title available?)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center
- The general facility location problem with connectivity on trees
- scientific article; zbMATH DE number 2119651 (Why is no real title available?)
- 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)