1486 search results - page 29 / 298 » Algorithms for two-box covering |
ESA
2004
Springer
15 years 2 months ago
2004
Springer
109
click to vote
APPROX
2000
Springer
15 years 1 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...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
106
click to vote
STACS
2005
Springer
15 years 3 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...
74
Voted
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =