Sciweavers

365 search results - page 29 / 73
» On the Crossing Spanning Tree Problem
Sort
View
TWC
2008
112views more  TWC 2008»
13 years 9 months ago
Design and Analysis of Cross-Layer Tree Algorithms for Wireless Random Access
In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on suc...
Xin Wang, Yingqun Yu, Georgios B. Giannakis
JCO
2007
128views more  JCO 2007»
13 years 9 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...
CATA
2004
13 years 10 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares
ISBRA
2009
Springer
14 years 3 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
14 years 2 months ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...