Approximation and complexity of the capacitated geometric median problem
From MaRDI portal
Publication:2117109
DOI10.1007/978-3-030-79416-3_26OpenAlexW3174597319MaRDI QIDQ2117109
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_26
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algebraic degree of geometric optimization problems
- Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements
- A note on approximating Max-Bisection on regular graphs
- Faster algorithms for the constrained \(k\)-means problem
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- Solving some vector subset problems by Voronoi diagrams
- Finding k points with minimum diameter and related problems
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- Linear-time approximation schemes for clustering problems in any dimensions
- Approximate clustering via core-sets
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- Efficient Algorithms for the Capacitated 1-Median Problem
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- Constant approximation for k-median and k-means with outliers via iterative rounding
- An approximation scheme for a problem of search for a vector subset
- The problem of a minimal ball enclosing k points
- Geometric median in nearly linear time
This page was built for publication: Approximation and complexity of the capacitated geometric median problem
