Search Sciweavers | Sciweavers

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 ...

Michel X. Goemans, Jan Vondrák

claim paper

Read More »

129

click to vote

WG
2001
Springer

93views Theoretical Computer Science» more WG 2001»

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem

15 years 10 months ago

Download www.alice-dsl.net

Clemens Gröpl, Stefan Hougardy, Till Nierhoff...

claim paper

Read More »

139

click to vote

JISE
2006

107views more JISE 2006»

FasterDSP: A Faster Approximation Algorithm for Directed Steiner Tree Problem

15 years 5 months ago

Download www.iis.sinica.edu.tw

Ming-I Hsieh, Eric Hsiao-Kuang Wu, Meng-Feng Tsai

claim paper

Read More »

138

click to vote

ISAAC
2001
Springer

99views Algorithms» more ISAAC 2001»

Tree-Approximations for the Weighted Cost-Distance Problem

15 years 10 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers