FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE