Pages that link to "Item:Q3053149"
From MaRDI portal
The following pages link to Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design (Q3053149):
Displayed 14 items.
- Improved approximation algorithms for directed Steiner forest (Q414883) (← 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)
- Online covering with \(\ell_q\)-norm objectives and applications to network design (Q2205975) (← links)
- Approximability of capacitated network design (Q2354026) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- Approximation algorithms for priority Steiner tree problems (Q2695278) (← links)
- APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
- Minimum-Cost Network Design with (Dis)economies of Scale (Q3464060) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)