Sciweavers

672 search results - page 53 / 135
» Lower-stretch spanning trees
Sort
View
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
14 years 3 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
WADS
2007
Springer
156views Algorithms» more  WADS 2007»
14 years 2 months ago
Cuttings for Disks and Axis-Aligned Rectangles
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
Eynat Rafalin, Diane L. Souvaine, Csaba D. T&oacut...
MSN
2007
Springer
14 years 3 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
AFRIGRAPH
2006
ACM
14 years 2 months ago
Compression of dense and regular point clouds
We present a simple technique for single-rate compression of point clouds sampled from a surface, based on a spanning tree of the points. Unlike previous methods, we predict futur...
Bruce Merry, Patrick Marais, James E. Gain
INFOCOM
1992
IEEE
14 years 27 days ago
Topological Design of Interconnected LAN-MAN Networks
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...
Cem Ersoy, Shivendra S. Panwar