Minimizing eccentricity in composite networks via constrained edge additions

Proceedings - IEEE Military Communications Conference MILCOM

Volumn , Issue , 2013, Pages 1894-1899

  Perumal, Senni ^a   Basu, Prithwish ^a   Guan, Ziyu ^b  

^a BBN TECHNOLOGIES   (United States)

^b NORTHWEST UNIVERSITY   (China)

Author keywords

Composite networks; Constrained edge addition; Metric edge addition; Minimize eccentricity

Indexed keywords

COMMAND-AND-CONTROL; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DEPLOYMENT SCENARIOS; EDGE ADDITION; HIERARCHICAL GRAPHS; HIERARCHICAL NETWORK; MILITARY DEPLOYMENT; MINIMIZE ECCENTRICITY;

APPROXIMATION ALGORITHMS; COSTS; HEURISTIC ALGORITHMS; MILITARY COMMUNICATIONS; TOPOLOGY;

TREES (MATHEMATICS);

EID: 84897677621     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MILCOM.2013.319     Document Type: Conference Paper

References (8)

1. E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, "A survey and comparison of peer-to-peer overlay network schemes," IEEE Communi-cations Surveys and Tutorials, vol. 7, pp. 72-93, 2005.
2. S. V. Buldyrev, R. Parshani, G. Paul, H. E. Stanley, and S. Havlin, "Catastrophic cascade of failures in interdependent networks," Nature, vol. 464, pp. 1025-1028, April 2010.
3. D. Bil o, L. Guala, and G. Proietti, "Improved approximability and nonapproximability results for graph diameter decreasing problems," Theor. Comput. Sci., vol. 417, pp. 12-22, 2012.
4. E. D. Demaine and M. Zadimoghaddam, "Minimizing the diameter of a network using shortcut edges," in SWAT, ser. Lecture Notes in Computer Science, H. Kaplan, Ed., vol. 6139. Springer, 2010, pp. 420-431.
5. A. Meyerson and B. Tagiku, "Minimizing average shortest path distances via shortcut edge addition," in APPROX-RANDOM, ser. Lecture Notes in Computer Science, I. Dinur, K. Jansen, J. Naor, and J. D. P. Rolim, Eds., vol. 5687. Springer, 2009, pp. 272-285.
6. M. Papagelis, F. Bonchi, and A. Gionis, "Suggesting ghost edges for a smaller world," in In Proc. of the 20th ACM International Conf. on Information and Knowledge Management, 2011, pp. 2305-2308.
7. T. F. Gonzalez, "Clustering to minimize the maximum intercluster distance," Theoretical Computer Science, vol. 38, pp. 293-306, 1985.
8. P. Basu, R. Gibbens, and R. Allen, "A brief exploratory overview of a hierarchically labelled geo-located network of nodes," in In Proc. of the Annual Conference of the ITA 2012, Southampton, UK, Sept. 2012.