1298 search results - page 6 / 260 » The online set cover problem |
WALCOM
2010
IEEE
14 years 2 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
APPROX
2000
Springer
13 years 11 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
FCCM
2002
IEEE
14 years 10 days ago
2002
IEEE
COCOON
2010
Springer
13 years 11 months ago
2010
Springer
EOR
2010
13 years 7 months ago
2010
