36 search results - page 6 / 8 » Lower bounds for testing Euclidean Minimum Spanning Trees |
90
Voted
ESA
2009
Springer
15 years 7 months ago
2009
Springer
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...
118
Voted
ALGORITHMICA
2002
15 years 10 days ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
96
Voted
STOC
1992
ACM
15 years 4 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
114
click to vote
TSP
2008
15 years 10 days ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
99
Voted
PODC
2005
ACM
15 years 6 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...