Sciweavers

SODA
2004
ACM
156views Algorithms» more  SODA 2004»
13 years 6 months ago
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
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
MASCOTS
2004
13 years 6 months ago
Routing in an Internet-Scale Network Emulator
One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-pack...
Jay Chen, Diwaker Gupta, Kashi Venkatesh Vishwanat...
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
13 years 8 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
SWAT
1990
Springer
75views Algorithms» more  SWAT 1990»
13 years 8 months ago
Finding the k Smallest Spanning Trees
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
David Eppstein
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 9 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
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
SAC
2000
ACM
13 years 9 months ago
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
Günther R. Raidl, Bryant A. Julstrom
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
13 years 10 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom
AINTEC
2007
Springer
13 years 10 months ago
Quality-of-Service Multicast Overlay Spanning Tree Algorithms for Wireless Ad Hoc Networks
In this article, we explore modified versions of Multicast Overlay Spanning Tree algorithms (MOST) to support quality of service for wireless ad hoc networks. These algorithms (Q-...
Georgios Rodolakis, Cedric Adjih, Anis Laouiti, Sa...
AINA
2007
IEEE
13 years 11 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
AINA
2009
IEEE
13 years 11 months ago
Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks
— Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery paower, computing, and storage resources, the energy efficie...
Andrei Gagarin, Sajid Hussain, Laurence Tianruo Ya...