Efficient k-center algorithms for planar points in convex position
From MaRDI portal
(Redirected from Publication:6179418)
Efficient \(k\)-center algorithms for planar points in convex position
Efficient \(k\)-center algorithms for planar points in convex position
Cites work
- A faster algorithm for the two-center decision problem
- A near-linear algorithm for the planar 2-center problem
- Dynamic Three-Dimensional Linear Programming
- Efficient algorithms for the one-dimensional \(k\)-center problem
- Efficient planar two-center algorithms
- Exact and approximation algorithms for clustering
- Faster distance-based representative skyline and k-center along Pareto front in the plane
- Finding tailored partitions
- Geometric clustering in normed planes
- Geometric clusterings
- scientific article; zbMATH DE number 6472586 (Why is no real title available?)
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- More planar two-center algorithms
- Off-Line Maintenance of Planar Configurations
- On bisectors in normed planes
- On the planar two-center problem and circular hulls
- On the shape of a set of points in the plane
- Optimal shortest path queries in a simple polygon
- Slowing down sorting networks to obtain faster sorting algorithms
- The slab dividing approach to solve the Euclidean \(P\)-center problem
Cited in
(4)
This page was built for publication: Efficient \(k\)-center algorithms for planar points in convex position
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179418)
