672 search results - page 53 / 135 » Lower-stretch spanning trees |
122
Voted
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
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 ...
128
Voted
WADS
2007
Springer
15 years 10 months ago
2007
Springer
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 ...
123
Voted
MSN
2007
Springer
15 years 10 months ago
2007
Springer
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...
118
Voted
AFRIGRAPH
2006
ACM
15 years 9 months ago
2006
ACM
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...
129
click to vote
INFOCOM
1992
IEEE
15 years 7 months ago
1992
IEEE
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...