Sciweavers

970 search results - page 30 / 194
» On encodings of spanning trees
Sort
View
ICPADS
2005
IEEE
14 years 1 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
PRDC
2008
IEEE
14 years 1 months ago
On the Complexity of a Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
Julien Clement, Thomas Hérault, Stép...
EVOW
2007
Springer
14 years 1 months ago
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
Sandro Pirkwieser, Günther R. Raidl, Jakob Pu...
WWIC
2007
Springer
182views Communications» more  WWIC 2007»
14 years 1 months ago
Multicast Overlay Spanning Tree Protocol for Ad Hoc Networks
In this paper we present an extension to the OLSR unicast routing protocol to support multicast routing in mobile ad hoc networks. The proposed protocol is based on Multicast Overl...
Georgios Rodolakis, Amina Meraihi Naimi, Anis Laou...
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
14 years 1 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener