839 search results - page 10 / 168 » Three-Clustering of Points in the Plane |
FFA
2008
13 years 7 months ago
2008
DCC
2000
IEEE
13 years 7 months ago
2000
IEEE
GC
2011
Springer
12 years 11 months ago
2011
Springer
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points to a target point using a sequence of sweeps? In a sweep, the sweep-line is plac...