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...
Main Authors: | , |
---|---|
Other Authors: | , |
Format: | Article |
Language: | English |
Published: |
Springer,
2011-04-15T17:35:21Z.
|
Subjects: | |
Online Access: | Get fulltext |