Minimizing average shortest path distances via shortcut edge addition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 272-285

  Meyerson, Adam ^a   Tagiku, Brian ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; EDGE ADDITION; K-MEDIAN; METRIC K-MEDIAN; RUNTIMES; SHORTEST PATH; WEIGHTED AVERAGES;

COMBINATORIAL OPTIMIZATION; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70350594729     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_21     Document Type: Conference Paper

References (22)

1. Andrews, M.: Hardness of buy-at-bulk network design. In: Annual Symposium on Foundations of Computer Science (2004)
2. Archer, A.: Inapproximability of the asymmetric facility location and k-median problems (unpublished manuscript) (2000)
3. 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)
4. Awerbuch, B., Azar, Y.: Buy-at-bulk network design. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, p. 542 (1997)
5. Benini, L., De Micheli, G.: Networks on chips: A new SoC paradigm. Computer 35(1), 70-78 (2002)
6. 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)
7. 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)
8. 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)
9. 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)
10. 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)
11. 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)
12. 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)
13. Ho, R., Mai, K.W., Horowitz, M.A.: The future of wires. Proceedings of the IEEE 89(4), 490-504 (2001)
14. 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)
15. Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 163-170 (2000)
16. 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)
17. 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)
18. 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)
19. 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)
20. 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)
21. Sandberg, O., Clarke, I.: The evolution of navigable small-world networks. Technical report, Chalmers University of Technology (2007)
22. Watts, D.J., Strogatz, S.H.: Collective dynamics of 'small world' networks. Nature 393, 440-442 (1998)