A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
From MaRDI portal
Publication:2015804
DOI10.1007/s10878-012-9544-1zbMath1297.90172OpenAlexW2911784287MaRDI QIDQ2015804
Publication date: 24 June 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9544-1
Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for the generalized \(k\)-multicut problem
- Deterministic sampling algorithms for network design
- Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation
- Connected facility location via random facility sampling and core detouring
- Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
- New Approaches for Virtual Private Network Design
- Approximation via cost sharing
- Simpler and better approximation algorithms for network design
- On non-uniform multicommodity buy-at-bulk network design
- Saving an epsilon
- The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
- Network Design via Core Detouring for Problems without a Core
- On the approximability of some network design problems
- A constant factor approximation for the single sink edge installation problems
- Provisioning a virtual private network
- A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design
- Algorithm Theory - SWAT 2004
- Improved Approximation for Single-Sink Buy-at-Bulk
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication: A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
