1486 search results - page 29 / 298 » Algorithms for two-box covering |
70
Voted
ESA
2004
Springer
15 years 6 months ago
2004
Springer
144
Voted
APPROX
2000
Springer
15 years 5 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...
100
click to vote
SODA
2003
ACM
15 years 2 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
128
click to vote
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
APPROX
2007
Springer
15 years 7 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =