Sciweavers

8 search results - page 2 / 2
» Balancing Degree, Diameter and Weight in Euclidean Spanners
Sort
View
ESA
2005
Springer
89views Algorithms» more  ESA 2005»
13 years 11 months ago
Experimental Study of Geometric t-Spanners
Abstract. The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. In this paper we perform the first extens...
Mohammad Farshi, Joachim Gudmundsson
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 1 days 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
AINA
2009
IEEE
14 years 8 days 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...