552 search results - page 43 / 111 » Lower bounds for dynamic connectivity |
INFOCOM
1990
IEEE
14 years 1 months ago
1990
IEEE
This paper analyzes the fault tolerance of a class of double-loop networks referred to as forwardloop backward-hop FLBH, in which each node is connected via unidirectional links t...
CPC
2008
13 years 9 months ago
2008
![B2[ g] Sets and a Conjecture of Schinzel and Schmidt](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "B2[ g] Sets and a Conjecture of Schinzel and Schmidt")
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a + a , with a a and a, a A. We obtain a new lower bound for F(g, n), t...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
AAAI
2008
13 years 12 months ago
2008
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...