349 search results - page 15 / 70 » Covering a Set of Points with a Minimum Number of Lines |
DM
2002
13 years 7 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
EJC
2010
13 years 8 months ago
2010
In this paper, we investigate some properties of partial covers of PG(n, q). We show that a set of q + a hyperplanes, q 81, a < (q - 1)/3, or q > 13 and a (q - 10)/4, that...
JAL
2006
13 years 7 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
SODA
1993
ACM
13 years 9 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
TALG
2008
13 years 7 months ago
2008
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...