Pages that link to "Item:Q2706344"
From MaRDI portal
The following pages link to Approximating the Single-Sink Link-Installation Problem in Network Design (Q2706344):
Displaying 24 items.
- Approximating capacitated tree-routings in networks (Q630195) (← links)
- Approximating some network design problems with node costs (Q638508) (← links)
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- On the approximation of the generalized capacitated tree-routing problem (Q988692) (← 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 primal-dual algorithm for the generalized prize-collecting Steiner forest problem (Q1706681) (← links)
- Approximating the \(k\)-splittable capacitated network design problem (Q1751198) (← links)
- Two-level hub Steiner trees (Q2059893) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- Exact approaches to the single-source network loading problem (Q2892148) (← links)
- Approximation Schemes for Capacitated Geometric Network Design (Q3012789) (← links)
- Oblivious Buy-at-Bulk in Planar Graphs (Q3078378) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
- Approximation Schemes for Capacitated Geometric Network Design (Q4556954) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- Exact Approaches for Designing Multifacility Buy-at-Bulk Networks (Q5131690) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
- Approximation to the Minimum Cost Edge Installation Problem (Q5387765) (← links)
- Light Spanners (Q5499739) (← links)
- Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)
