Pages that link to "Item:Q1026237"
From MaRDI portal
The following pages link to Improved approximation algorithms for the single-sink buy-at-bulk network design problems (Q1026237):
Displaying 6 items.
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
- An improved approximation algorithm for the uniform cost-distance Steiner tree problem (Q2117699) (← links)
- Approximating the single-sink link-installation problem in network design (Q2706344) (← links)
- One tree suffices: a simultaneous \(O(1)\)-approximation for single-sink buy-at-bulk (Q2913815) (← links)
- A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design (Q5199176) (← links)
- Algorithm Theory - SWAT 2004 (Q5315385) (← links)