Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
DOI10.1016/J.DAM.2016.05.016zbMATH Open1344.05128OpenAlexW2433497404MaRDI QIDQ313789FDOQ313789
Authors: Andreas Bley, Mohsen Rezapour 
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
Recommendations
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- Primal-dual algorithms for connected facility location problems
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- Approximation algorithms for connected facility location problems
Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25)
Cites Work
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- An improved LP-based approximation for Steiner tree
- Primal-dual algorithms for connected facility location problems
- Simpler and better approximation algorithms for network design
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Connected facility location via random facility sampling and core detouring
- Improved approximation guarantees for lower-bounded facility location
- From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk
- Lower-bounded facility location
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Cost-Distance: Two Metric Network Design
- Network design via core detouring for problems without a core
- A constant factor approximation for the single sink edge installation problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- A constant factor approximation for the single sink edge installation problems
- Algorithm Theory - SWAT 2004
- Improved Approximation for Single-Sink Buy-at-Bulk
Cited In (6)
- Exact approaches for designing multifacility buy-at-bulk networks
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- Approximation algorithms for facility location with capacitated and length-bounded tree connections
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- LP-based approximation algorithms for facility location in buy-at-bulk network design
This page was built for publication: Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313789)
