Recent developments in approximation algorithms for facility location and clustering problems
From MaRDI portal
Recommendations
- A survey on approximation algorithms for facility location problems
- scientific article; zbMATH DE number 1670526
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- scientific article; zbMATH DE number 1303535
- Analysis of a Local Search Heuristic for Facility Location Problems
Cites work
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A 3-approximation algorithm for the facility location problem with uniform capacities
- A 5-approximation for capacitated facility location
- A Best Possible Heuristic for the k-Center Problem
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- A dependent LP-rounding approach for the k-median problem
- A new greedy approach for facility location problems
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Analysis of a Local Search Heuristic for Facility Location Problems
- Approximating k-median via pseudo-approximation
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Bi-factor approximation algorithms for hard capacitated k-median problems
- Centrality of trees for capacitated \(k\)-center
- Constant approximation for capacitated \(k\)-median with \((1+\epsilon)\)-capacity violation
- Easy and hard bottleneck location problems
- Evaluation of a Branch and Bound Algorithm for Clustering
- Faces for a linear inequality in 0–1 variables
- Greedy Strikes Back: Improved Facility Location Algorithms
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- scientific article; zbMATH DE number 1303535 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- Improved approximation algorithms for capacitated facility location problems
- Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- Improved Combinatorial Algorithms for Facility Location Problems
- Local search heuristic for k-median and facility location problems
- LP-based algorithms for capacitated facility location
- The analysis of a simple k -means clustering algorithm
Cited in
(6)- A bicriteria approximation algorithm for the \(k\)-center and \(k\)-median problems
- An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee
- scientific article; zbMATH DE number 1629976 (Why is no real title available?)
- Discrete facility location in machine learning
- A survey on approximation algorithms for facility location problems
- When far is better: the Chamberlin-Courant approach to obnoxious committee selection
This page was built for publication: Recent developments in approximation algorithms for facility location and clustering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4689624)
