The following pages link to (Q4737546):
Displayed 19 items.
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← 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)
- Two-level hub Steiner trees (Q2059893) (← links)
- An improved approximation algorithm for the uniform cost-distance Steiner tree problem (Q2117699) (← links)
- Group parking permit problems (Q2184679) (← links)
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← 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)
- From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
- LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design (Q3449835) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← 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)
- (Q5743493) (← links)