30 search results - page 2 / 6 » algorithmica 2006 |
103
click to vote
ALGORITHMICA
2006
14 years 10 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
ALGORITHMICA
2006
14 years 10 months ago
2006
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
ALGORITHMICA
2006
14 years 10 months ago
2006
We present some fundamental structural properties for minimum length networks (known as Steiner minimum trees) interconnecting a given set of points in an environment in which edg...
121
click to vote
ALGORITHMICA
2006
14 years 10 months ago
2006
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
ALGORITHMICA
2006
14 years 10 months ago
2006
We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...