16 search results - page 2 / 4 » A Tight Lower Bound for the Steiner Point Removal Problem on... |
COMPGEOM
1992
ACM
13 years 9 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
ESA
2009
Springer
13 years 11 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...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
TIT
2011
12 years 11 months ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...