1414 search results - page 35 / 283 » Cover Time and Broadcast Time |
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
CCCG
2008
13 years 11 months ago
2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
TCS
2010
13 years 8 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...
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
PODC
1989
ACM
14 years 1 months ago
1989
ACM
Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Effi...