Separating a Voronoi diagram via local search
From MaRDI portal
Publication:3132852
Recommendations
- Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. II: Algorithms for constructing Voronoi diagrams based on the theory of optimal set partitioning
- scientific article; zbMATH DE number 4098181
- Recognizing Voronoi Diagrams with Linear Programming
- Concrete and abstract Voronoi diagrams
- From proximity to utility: a Voronoi partition of Pareto optima
Cited in
(4)- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
- Packing and covering with non-piercing regions
- Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants
- scientific article; zbMATH DE number 1944340 (Why is no real title available?)
This page was built for publication: Separating a Voronoi diagram via local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132852)