Approximation algorithm for uniform bounded facility location problem
From MaRDI portal
Publication:2392747
DOI10.1007/S10878-012-9461-3zbMATH Open1275.90037OpenAlexW2007108869MaRDI QIDQ2392747FDOQ2392747
Authors: Weng Kerui 
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
Recommendations
- Approximation algorithm for the uniform bounded facility problem
- An approximation framework for bounded facility location problems
- A 3-approximation algorithm for the facility location problem with uniform capacities
- A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem
- Algorithms - ESA 2003
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- A threshold of ln n for approximating set cover
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- Algorithms for facility location problems with outliers. (Extended abstract)
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Title not available (Why is that?)
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved Combinatorial Algorithms for Facility Location Problems
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Approximation Algorithms for Metric Facility Location Problems
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
- A better constant-factor approximation for weighted dominating set in unit disk graph
- Medi-centre Location Problems
- Approximation algorithms for bounded facility location problems
- The approximation gap for the metric facility location problem is not yet closed
Cited In (6)
- On facility location with general lower bounds
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- Approximation algorithm for the uniform bounded facility problem
- An approximation framework for bounded facility location problems
- A voltage drop limited decentralized electric power distribution network
This page was built for publication: Approximation algorithm for uniform bounded facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392747)
