Approximation algorithms for continuous clustering and facility location problems
From MaRDI portal
Cites work
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A Best Possible Heuristic for the k-Center Problem
- A bicriteria approximation algorithm for the \(k\)-center and \(k\)-median problems
- A constant-factor approximation algorithm for the k-median problem
- A heuristic for the p-center problem in graphs
- A local search approximation algorithm for \(k\)-means clustering
- A new coreset framework for clustering
- A PTAS for k-means clustering based on weak coresets
- A technique for obtaining true approximations for \(k\)-center with covering constraints
- Algorithms for facility location problems with outliers. (Extended abstract)
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Approximability of capacitated network design
- Approximating k-median via pseudo-approximation
- Approximation algorithms for continuous clustering and facility location problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation schemes for clustering problems
- Better guarantees for k-means and euclidean k-median by primal-dual algorithms
- Generalized center problems with outliers
- Geometric algorithms and combinatorial optimization.
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
- Greedy Strikes Back: Improved Facility Location Algorithms
- scientific article; zbMATH DE number 1670653 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 7788494 (Why is no real title available?)
- Improved approximations for Euclidean k -means and k -median, via nested quasi-independent sets
- Inapproximability of clustering in Lp metrics
- Johnson coverage hypothesis: inapproximability of k-means and k-median in _p-metrics
- Local Search Heuristics for k-Median and Facility Location Problems
- Local search yields a PTAS for \(k\)-means in doubling metrics
- Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
- LP-based algorithms for capacitated facility location
- On k-Median clustering in high dimensions
- On approximate geometric \(k\)-clustering
- On coresets for k-means and k-median clustering
- Steiner tree approximation via iterative randomized rounding
- The Non-Uniform k -Center Problem
- When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
Cited in
(3)
This page was built for publication: Approximation algorithms for continuous clustering and facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969650)
