Approximation Algorithms for Buy-at-Bulk Geometric Network Design
From MaRDI portal
Recommendations
- Approximation algorithms for buy-at-bulk geometric network design
- Approximation algorithms for nonuniform buy-at-bulk network design
- Approximation algorithms for node-weighted buy-at-bulk network design
- Improved Approximation for Single-Sink Buy-at-Bulk
- Approximating directed buy-at-bulk network design
Cites work
- A catalog of Hanan grid problems
- A constant factor approximation for the single sink edge installation problems
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
- Approximating the single-sink link-installation problem in network design
- Approximation algorithms for a capacitated network design problem
- Approximation algorithms for node-weighted buy-at-bulk network design
- Cost-Distance: Two Metric Network Design
- Discrete cost multicommodity network optimization problems and exact solution methods
- Fast approximation schemes for Euclidean multi-connectivity problems. (Extended abstract)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1305417 (Why is no real title available?)
- scientific article; zbMATH DE number 1775394 (Why is no real title available?)
- scientific article; zbMATH DE number 1775442 (Why is no real title available?)
- Improved approximation algorithms for the single-sink buy-at-bulk network design problems
- Improved Approximation for Single-Sink Buy-at-Bulk
- Minimum cost capacity installation for multicommodity network flows
- On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Simpler and better approximation algorithms for network design
- Source sink flows with capacity installation in batches
- The single-sink buy-at-bulk LP has constant integrality gap
Cited in
(4)
This page was built for publication: Approximation Algorithms for Buy-at-Bulk Geometric Network Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183450)