823 search results - page 2 / 165 » Stateful Subset Cover |
ALGORITHMICA
2010
13 years 6 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
AFRICACRYPT
2008
Springer
14 years 9 days ago
2008
Springer
ASIACRYPT
2005
Springer
13 years 11 months ago
2005
Springer
DATE
2004
IEEE
13 years 9 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
TCS
2010
13 years 4 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...