Search Sciweavers | Sciweavers

396 search results - page 7 / 80

» An Optimal Minimum Spanning Tree Algorithm

click to vote

SODA
2004
ACM

156views Algorithms» more SODA 2004»

Approximating Minimum Max-Stretch spanning Trees on unweighted graphs

13 years 8 months ago

Download www.eng.tau.ac.il

Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...

Yuval Emek, David Peleg

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 9 months ago

Download www.ti.inf.ethz.ch

Beat Gfeller

claim paper

Read More »

click to vote

PPSN
2010
Springer

197views Distributed And Parallel Com...» more PPSN 2010»

Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem

13 years 5 months ago

Download www.ads.tuwien.ac.at

Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...

Mario Ruthmair, Günther R. Raidl

claim paper

Read More »

click to vote

JISE
2008

107views more JISE 2008»

Ant Colony Optimization Approaches to the Degree-constrained Minimum Spanning Tree Problem

13 years 7 months ago