117 search results - page 1 / 24 » Minimizing the Diameter of a Network Using Shortcut Edges |
SWAT
2010
Springer
13 years 2 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
COMPGEOM
2005
ACM
13 years 6 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
WDAG
2007
Springer
13 years 10 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
IJCM
2002
13 years 4 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...