On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem
From MaRDI portal
Recommendations
- The single-sink buy-at-bulk LP has constant integrality gap
- Improved Approximation for Single-Sink Buy-at-Bulk
- Improved approximation algorithms for the single-sink buy-at-bulk network design problems
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- Improved approximation algorithms for the single-sink buy-at-bulk network design problems
Cited in
(12)- Improved approximation algorithms for the single-sink buy-at-bulk network design problems
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- The single-sink buy-at-bulk LP has constant integrality gap
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- Exact approaches for designing multifacility buy-at-bulk networks
- Improved Approximation for Single-Sink Buy-at-Bulk
- Deterministic sampling algorithms for network design
- LP-based approximation algorithms for facility location in buy-at-bulk network design
This page was built for publication: On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537744)