103 search results - page 4 / 21 » The Cover Time of Random Digraphs |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
ICALP
2001
Springer
14 years 6 days ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
WOWMOM
2009
ACM
14 years 2 months ago
2009
ACM
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...