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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on computing Jg. 34; H. 6; S. 1370 - 1379
Hauptverfasser:	Chazelle, Bernard, Rubinfeld, Ronitt, Trevisan, Luca
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2005
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!