Approximating the Single-Sink Link-Installation Problem in Network Design
From MaRDI portal
Publication:2706344
DOI10.1137/S1052623497321432zbMath1010.90002MaRDI QIDQ2706344
No author found.
Publication date: 19 March 2001
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
Exact approaches to the single-source network loading problem ⋮ Approximation Algorithms for Buy-at-Bulk Geometric Network Design ⋮ Online Buy-at-Bulk Network Design ⋮ APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN ⋮ Approximating capacitated tree-routings in networks ⋮ Euclidean prize-collecting Steiner forest ⋮ Approximating some network design problems with node costs ⋮ A primal-dual algorithm for the generalized prize-collecting Steiner forest problem ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope ⋮ Exact Approaches for Designing Multifacility Buy-at-Bulk Networks ⋮ Approximation to the Minimum Cost Edge Installation Problem ⋮ Approximation Schemes for Capacitated Geometric Network Design ⋮ Approximating the \(k\)-splittable capacitated network design problem ⋮ On the approximation of the generalized capacitated tree-routing problem ⋮ Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph ⋮ The Greedy Spanner Is Existentially Optimal ⋮ Hallucination Helps: Energy Efficient Virtual Circuit Routing ⋮ Oblivious Buy-at-Bulk in Planar Graphs ⋮ Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees ⋮ Two-level hub Steiner trees ⋮ Improved approximation algorithms for the single-sink buy-at-bulk network design problems ⋮ Light Spanners ⋮ Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones ⋮ Approximation Schemes for Capacitated Geometric Network Design
