Abstract
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices. We explore several variations of the problem and give O(1)-approximations for each. We also improve the best known approximation ratio for metric k-median with penalties, as many of our approximations depend upon this bound. We give a \((1+2\frac{(p+1)}{\beta(p+1)-1},\beta)\)-approximation with runtime exponential in p. If we set β = 1 (to be exact on the number of medians), this matches the best current k-median (without penalties) result.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrews, M.: Hardness of buy-at-bulk network design. In: Annual Symposium on Foundations of Computer Science (2004)
Archer, A.: Inapproximability of the asymmetric facility location and k-median problems (unpublished manuscript) (2000)
Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. In: Symposium on Theory of Computing (2001)
Awerbuch, B., Azar, Y.: Buy-at-bulk network design. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, p. 542 (1997)
Benini, L., De Micheli, G.: Networks on chips: A new SoC paradigm. Computer 35(1), 70–78 (2002)
Chang, M.-C.F., Cong, J., Kaplan, A., Liu, C., Naik, M., Premkumar, J., Reinman, G., Socher, E., Tam, S.-W.: Power reduction of CMP communication networks via RF-interconnects. In: Proceedings of the 41st Annual International Symposium on Microarchitecture (November 2008)
Chang, M.-C.F., Cong, J., Kaplan, A., Naik, M., Reinman, G., Socher, E., Tam, S.-W.: CMP network-on-chip overlaid with multi-band RF-interconnect. In: International Symposium on High Performance Computer Architecture (February 2008)
Chang, M.-C.F., Roychowdhury, V.P., Zhang, L., Shin, H., Qian, Y.: RF/wireless interconnect for inter- and intra-chip communications. Proceedings of the IEEE 89(4), 456–466 (2001)
Chang, M.-C.F., Socher, E., Tam, S.-W., Cong, J., Reinman, G.: RF interconnects for communications on-chip. In: Proceedings of the 2008 international symposium on Physical design, pp. 78–83. ACM Press, New York (2008)
Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Symposium on Discrete Algorithms, pp. 642–651 (2001)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
Gupta, A., Kumar, A., Pal, M., Roughgarden, T.: Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem. In: Proceedings 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 606–615 (October 2003)
Ho, R., Mai, K.W., Horowitz, M.A.: The future of wires. Proceedings of the IEEE 89(4), 490–504 (2001)
Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 731–740 (2002)
Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 163–170 (2000)
Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms (1998)
Manfredi, S., di Bernardo, M., Garofalo, F.: Small world effects in networks: An engineering interpretation. In: Proceedings of the 2004 International Symposium on Circuits and Systems, May 2004, vol. 4, IV–820–3 (2004)
Martel, C., Nguyen, V.: Analyzing Kleinberg’s (and other) small-world models. In: 23rd ACM Symp. on Principles of Distributed Computing, pp. 179–188. ACM Press, New York (2004)
Meyerson, A., Munagala, K., Plotkin, S.: Cost-distance: Two metric network design. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 624–630 (2000)
Ogras, U.Y., Marculescu, R.: It’s a small world after all: NoC performance optimization via long-range link insertion. IEEE Transactions on Very Large Scale Integration Systems 14(7), 693–706 (2006)
Sandberg, O., Clarke, I.: The evolution of navigable small-world networks. Technical report, Chalmers University of Technology (2007)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small world’ networks. Nature 393, 440–442 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyerson, A., Tagiku, B. (2009). 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. APPROX RANDOM 2009 2009. Lecture Notes in Computer Science, vol 5687. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03685-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-03685-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03684-2
Online ISBN: 978-3-642-03685-9
eBook Packages: Computer ScienceComputer Science (R0)