Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
From MaRDI portal
Publication:313789
DOI10.1016/j.dam.2016.05.016zbMath1344.05128OpenAlexW2433497404MaRDI QIDQ313789
Publication date: 12 September 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.05.016
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual algorithms for connected facility location problems
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Connected facility location via random facility sampling and core detouring
- Improved Approximation Guarantees for Lower-Bounded Facility Location
- An improved LP-based approximation for steiner tree
- From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Cost-Distance: Two Metric Network Design
- Simpler and better approximation algorithms for network design
- Network Design via Core Detouring for Problems without a Core
- A Constant Factor Approximation for the Single Sink Edge Installation Problem
- Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem
- A constant factor approximation for the single sink edge installation problems
- Provisioning a virtual private network
- Algorithm Theory - SWAT 2004
- Improved Approximation for Single-Sink Buy-at-Bulk
This page was built for publication: Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
