Sciweavers

672 search results - page 77 / 135
» Lower-stretch spanning trees
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...
ADHOCNOW
2007
Springer
14 years 1 months ago
Routing in Wireless Networks with Position Trees
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
Edgar Chávez, Nathalie Mitton, Hécto...
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 2 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
DAC
1989
ACM
13 years 11 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
ISMB
2007
13 years 10 months ago
Automatic genome-wide reconstruction of phylogenetic gene trees
Gene duplication and divergence is a major evolutionary force. Despite the growing number of fully sequenced genomes, methods for investigating these events on a genome-wide scale...
Ilan Wapinski, Avi Pfeffer, Nir Friedman, Aviv Reg...