Approximating the Minimum Spanning Tree Weight in Sublinear Time

We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set{1,...,w}, and given a parameter $0 < \eps < 1/2$, estimates in time $O( dw \varepsilon^{-2} \log{\frac{dw}\varepsilon})$ the weight of the min...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	SIAM journal on computing Ročník 34; číslo 6; s. 1370 - 1379
Hlavní autori:	Chazelle, Bernard, Rubinfeld, Ronitt, Trevisan, Luca
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2005
Predmet:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Combinatorics Combinatorics. Ordered structures Computer science Computer science; control theory; systems Exact sciences and technology Graph theory Graphs Information retrieval. Graph Mathematics Sciences and techniques of general use Theoretical computing Error estimation minimum spanning tree Connected graph sublinear time algorithms 68W25 Approximation algorithm Stochastic process approximation algorithms 68W20 Sublinear time algorithm Spanning tree randomized algorithms Relative error 68R10 Time complexity
ISSN:	0097-5397, 1095-7111
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!