Minimizing the Diameter of a Network Using Shortcut Edges

  • Erik D. Demaine
  • Morteza Zadimoghaddam
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6139)


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 resource augmentation to allow more than k shortcut edges. We observe a close relation between the single-source version of the problem, where we want to minimize the largest distance from a given source vertex, and the well-known k-median problem. First we show that our constant-factor approximation algorithms for the general case solve the single-source problem within a constant factor. Then, using a linear-programming formulation for the single-source version, we find a (1 + ε)-approximation using O(klogn) shortcut edges. To show the tightness of our result, we prove that any \(({3 \over 2}-\epsilon)\)-approximation for the single-source version must use Ω(klogn) shortcut edges assuming P ≠ NP.


Approximation algorithms network design network repair 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, pp. 89–98 (2006)Google Scholar
  2. 2.
    Benini, L., De Micheli, G.: Networks on chips: A new SoC paradigm. Computer 35(1), 70–78 (2002)CrossRefGoogle Scholar
  3. 3.
    Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 378–388 (1999)Google Scholar
  4. 4.
    Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: The price of anarchy in cooperative network creation games. SIGecom Exchanges 8(2) (December 2009)Google Scholar
  5. 5.
    Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: The price of anarchy in network creation games. In: Proceedings of the 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 292–298 (2007); To appear in ACM Transactions on AlgorithmsGoogle Scholar
  6. 6.
    Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proceedings of the 22nd Annual Symposium on Principles of Distributed Computing, Boston, MA, pp. 347–351 (2003)Google Scholar
  7. 7.
    Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634–652 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Kleinberg, J.: Small-world phenomena and the dynamics of information. Advances in Neural Information Processing Systems 14, 431–438 (2001)Google Scholar
  9. 9.
    Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 163–170 (2000)Google Scholar
  10. 10.
    Laoutaris, N., Poplawski, L., Rajaraman, R., Sundaram, R., Teng, S.-H.: Bounded budget connection (BBC) games or how to make friends and influence people, on a budget. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, pp. 165–174 (2008)Google Scholar
  11. 11.
    Meyerson, A., Tagiku, B.: Minimizing average shortest path distances via shortcut edge addition. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. LNCS, vol. 5687, pp. 272–285. Springer, Heidelberg (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Erik D. Demaine
    • 1
  • Morteza Zadimoghaddam
    • 1
  1. 1.MIT Computer Science and Artificial Intelligence LaboratoryCambridgeUSA

Personalised recommendations