Approximation algorithm for the uniform bounded facility problem
From MaRDI portal
Recommendations
- Approximation algorithm for uniform bounded facility location problem
- An approximation framework for bounded facility location problems
- A local search approximation algorithm for the uniform capacitated k-facility location problem
- Approximation algorithms for bounded facility location problems
- A 3-approximation algorithm for the facility location problem with uniform capacities
Cites work
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
- A threshold of ln n for approximating set cover
- Algorithms for facility location problems with outliers. (Extended abstract)
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Approximation algorithms for bounded facility location problems
- Approximation Algorithms for Metric Facility Location Problems
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- scientific article; zbMATH DE number 1253050 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved Combinatorial Algorithms for Facility Location Problems
- Medi-centre Location Problems
- The approximation gap for the metric facility location problem is not yet closed
This page was built for publication: Approximation algorithm for the uniform bounded facility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004651)