Geometric clusterings
Open Access
- 1 June 1991
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 12 (2), 341-356
- https://doi.org/10.1016/0196-6774(91)90007-l
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Covering convex sets with non-overlapping polygonsDiscrete Mathematics, 1990
- On clustering problems with connected optima in euclidean spacesDiscrete Mathematics, 1989
- Power Diagrams: Properties, Algorithms and ApplicationsSIAM Journal on Computing, 1987
- Voronoi Diagram in the Laguerre Geometry and Its ApplicationsSIAM Journal on Computing, 1985
- On the Complexity of Some Common Geometric Location ProblemsSIAM Journal on Computing, 1984
- On the complexity of locating linear facilities in the planeOperations Research Letters, 1982
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982