Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem
From MaRDI portal
Publication:4922116
DOI10.1007/978-3-642-38236-9_8zbMath1382.90044OpenAlexW173406547MaRDI QIDQ4922116
Mohsen Rezapour, Andreas Bley, S. Mehdi Hashemi
Publication date: 28 May 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38236-9_8
Deterministic network models in operations research (90B10) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual algorithms for connected facility location problems
- 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
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- Network Design via Core Detouring for Problems without a Core
- A constant factor approximation for the single sink edge installation problems
- Provisioning a virtual private network
- Algorithm Theory - SWAT 2004
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
This page was built for publication: Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem
