Improved Approximation for Single-Sink Buy-at-Bulk

DOI10.1007/11940128_13zbMath1135.90422OpenAlexW1531667076WikidataQ61609590 ScholiaQ61609590MaRDI QIDQ5459107

Giuseppe F. Italiano, Fabrizio Grandoni

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_13

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items

Exact approaches to the single-source network loading problem, Combinatorial approximation algorithms for buy-at-bulk connected facility location problems, Approximation Algorithms for Buy-at-Bulk Geometric Network Design, Group parking permit problems, Connected facility location via random facility sampling and core detouring, Approximation to the Minimum Cost Edge Installation Problem, Approximation Algorithms for Single and Multi-Commodity Connected Facility Location, Approximating the \(k\)-splittable capacitated network design problem, Deterministic sampling algorithms for network design, A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design, On the approximation of the generalized capacitated tree-routing problem, Approximation algorithms for connected facility location problems, Improved approximation algorithms for the single-sink buy-at-bulk network design problems