Approximation and complexity of the capacitated geometric median problem
From MaRDI portal
Publication:2117109
Cites work
- A note on approximating Max-Bisection on regular graphs
- Algorithms for facility location problems with outliers. (Extended abstract)
- An approximation scheme for a problem of search for a vector subset
- Approximate clustering via core-sets
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- Constant approximation for k-median and k-means with outliers via iterative rounding
- Efficient Algorithms for the Capacitated 1-Median Problem
- Faster algorithms for the constrained k-means problem
- Finding k points with minimum diameter and related problems
- Geometric median in nearly linear time
- scientific article; zbMATH DE number 5764796 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- Linear-time approximation schemes for clustering problems in any dimensions
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements
- Solving some vector subset problems by Voronoi diagrams
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- The algebraic degree of geometric optimization problems
- The problem of a minimal ball enclosing k points
This page was built for publication: Approximation and complexity of the capacitated geometric median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117109)
