Minimizing the Diameter of a Network Using Shortcut Edges

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 approximation algorithms for different variations of this problem. We also show how to improve the approximation ratios using...

Full description

Bibliographic Details
Main Authors: Demaine, Erik D. (Contributor), Zadimoghaddam, Morteza (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer, 2011-04-15T17:35:21Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items