Approximation algorithm for uniform bounded facility location problem
From MaRDI portal
Publication:2392747
DOI10.1007/s10878-012-9461-3zbMath1275.90037OpenAlexW2007108869MaRDI QIDQ2392747
Publication date: 2 August 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9461-3
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (2)
A distance-limited continuous location-allocation problem for spatial planning of decentralized systems ⋮ A voltage drop limited decentralized electric power distribution network
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- A better constant-factor approximation for weighted dominating set in unit disk graph
- The approximation gap for the metric facility location problem is not yet closed
- A threshold of ln n for approximating set cover
- Medi-centre Location Problems
- Approximation Algorithms for Metric Facility Location Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved Combinatorial Algorithms for Facility Location Problems
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Approximation algorithms for bounded facility location problems
This page was built for publication: Approximation algorithm for uniform bounded facility location problem
