Approximating the single-sink link-installation problem in network design
From MaRDI portal
Recommendations
- A constant factor approximation for the single sink edge installation problem
- Improved Approximation for Single-Sink Buy-at-Bulk
- A constant factor approximation for the single sink edge installation problems
- Algorithm Theory - SWAT 2004
- Improved approximation algorithms for the single-sink buy-at-bulk network design problems
Cited in
(34)- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
- Improved approximation algorithms for the single-sink buy-at-bulk network design problems
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem
- Approximating the \(k\)-splittable capacitated network design problem
- Two-level hub Steiner trees
- Euclidean prize-collecting Steiner forest
- Exact approaches to the single-source network loading problem
- Approximation schemes for capacitated geometric network design
- Oblivious buy-at-bulk in planar graphs
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design
- Approximation algorithms for buy-at-bulk geometric network design
- Cost-Distance: Two Metric Network Design
- A constant factor approximation for the single sink edge installation problem
- Approximation schemes for capacitated geometric network design
- Online Buy-at-Bulk Network Design
- Modelling the neighbour aid phenomenon for installing costly complex networks
- The greedy spanner is existentially optimal
- Network installation under convex costs
- Exact approaches for designing multifacility buy-at-bulk networks
- A constant factor approximation for the single sink edge installation problems
- Hallucination helps: energy efficient virtual circuit routing
- Approximation to the Minimum Cost Edge Installation Problem
- Light spanners
- Steiner shallow-light trees are exponentially lighter than spanning ones
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
- Approximating capacitated tree-routings in networks
- Approximating some network design problems with node costs
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope
- A unified framework of light spanners. I: Fast (yet optimal) constructions
- Greedy spanners in Euclidean spaces admit sublinear separators
- Further acceleration in computing the gap greedy spanner: an empirical approach
- Bicriterial approximation for the incremental prize-collecting Steiner-tree problem
- Directed buy-at-bulk spanners
- On the approximation of the generalized capacitated tree-routing problem
This page was built for publication: Approximating the single-sink link-installation problem in network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706344)
