349 search results - page 6 / 70 » Covering a Set of Points with a Minimum Number of Lines |
DM
2008
13 years 7 months ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
DAM
2011
13 years 2 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
DCG
2010
13 years 7 months ago
2010
Let S be a set of r red points and b = r +2 blue points in general position in the plane. A line determined by them is said to be balanced if in each open half-plane bounded by th...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...