Sciweavers

WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
13 years 11 months ago
The Covert Set-Cover Problem with Application to Network Discovery
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 ...
Sandeep Sen, V. N. Muralidhara