Geometric clusterings

Journal of Algorithms

Volumn 12, Issue 2, 1991, Pages 341-356

  Capoyleas, Vasilis ^a   Rote, Günter ^b   Woeginger, Gerhard ^b  

^a NEW YORK UNIVERSITY   (United States)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000848826     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(91)90007-L     Document Type: Article

References (18)

1. Clustering algorithms based on minimum and maximum spanning trees
2. Power diagrams: Properties, algorithms, and applications
3. On clustering problems with connected optima in Euclidean spaces
4. On the complexity of clustering problems
5. The p-centre problem—Heuristic and optimal algorithms
6. Covering Convex Sets with Non-overlapping Polygons
7. Optimal algorithms for approximate clustering
8. Some packing and covering theorems
9. Finding tailored partitions
10. Voronoi diagrams in the Laguerre metric and its applications
11. The NP-completeness column: An ongoing guide
12. On the complexity of some common geometric location problems
13. On the complexity of locating linear facilities in the plane
14. Partitioning points and graphs to minimize the maximum or the sum of diameters
15. Topics in Computational Geometry