Sciweavers

SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
13 years 9 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
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...
Erik D. Demaine, Morteza Zadimoghaddam