51 search results - page 4 / 11 » Improved upper bounds for vertex cover |
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— We use the idea of dependence balance [1] to obtain the first improvement over the cut-set bound for the discrete memoryless multiple access channel with noiseless feedback (M...
DM
2002
13 years 6 months ago
2002
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
FCT
2007
Springer
14 years 26 days ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...