666 search results - page 24 / 134 » The Pipelined Set Cover Problem |
LREC
2010
13 years 11 months ago
2010
As the data for more and more languages is finding its way into digital form, with an increasing amount of this data being posted to the Web, it has become possible to collect lan...
DAM
1999
13 years 9 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...