Search Sciweavers | Sciweavers

140 search results - page 2 / 28

» Computing Minimum Spanning Trees with Uncertainty

click to vote

CORR
2006
Springer

153views Education» more CORR 2006»

A distributed approximation algorithm for the minimum degree minimum weight spanning trees

13 years 4 months ago

Download www-lipn.univ-paris13.fr

Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...

Christian Lavault, Mario Valencia-Pabon

claim paper

Read More »

click to vote

SAC
2009
ACM

157views Applied Computing» more SAC 2009»

Autonomous networked robots for the establishment of wireless communication in uncertain emergency response scenarios

13 years 9 months ago

Download sa.ee.ic.ac.uk

During a disaster, emergency response operations can beneﬁt from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...

Stelios Timotheou, Georgios Loukas

claim paper

Read More »

click to vote

CIAC
2000
Springer

210views Algorithms» more CIAC 2000»

Computing a Diameter-Constrained Minimum Spanning Tree in Parallel

13 years 9 months ago

Download www.cs.ucf.edu

A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...

Narsingh Deo, Ayman Abdalla

claim paper

Read More »

click to vote

ESA
2008
Springer

88views Algorithms» more ESA 2008»

Faster Swap Edge Computation in Minimum Diameter Spanning Trees

13 years 6 months ago