The following pages link to Algorithm Theory - SWAT 2004 (Q5315385):
Displaying 16 items.
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
- LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
- On the approximation of the generalized capacitated tree-routing problem (Q988692) (← links)
- Approximation algorithms for connected facility location problems (Q1016041) (← links)
- Improved approximation algorithms for the single-sink buy-at-bulk network design problems (Q1026237) (← 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)
- 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)
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
- Single-sink network design with vertex connectivity requirements (Q3165953) (← 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)
- Exact Approaches for Designing Multifacility Buy-at-Bulk Networks (Q5131690) (← links)
- A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design (Q5199176) (← links)
