Pages that link to "Item:Q5175993"
From MaRDI portal
The following pages link to A constant factor approximation for the single sink edge installation problems (Q5175993):
Displaying 13 items.
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- Improved approximation algorithms for the single-sink buy-at-bulk network design problems (Q1026237) (← links)
- A note on the subadditive network design problem (Q1038103) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
- Approximability of unsplittable shortest path routing problems (Q3057101) (← links)
- Oblivious Buy-at-Bulk in Planar Graphs (Q3078378) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design (Q3449835) (← links)
- Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem (Q4922116) (← links)
- Approximation to the Minimum Cost Edge Installation Problem (Q5387765) (← links)