Maximum betweenness centrality: Approximability and tractable cases

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

Volumn 6552 LNCS, Issue , 2011, Pages 9-20

  Fink, Martin ^a   Spoerhase, Joachim ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMABILITY; APPROXIMATION RATIOS; BETWEENNESS CENTRALITY; COMMUNICATION PATH; MAXIMUM COVERAGE; NP-HARD; POLYNOMIAL-TIME ALGORITHMS; TREE GRAPH;

APPROXIMATION ALGORITHMS; COMMUNICATION;

TREES (MATHEMATICS);

EID: 79952255763     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19094-0_4     Document Type: Conference Paper

References (13)

1. Ageev, A.A., Sviridenko, M.I.: Approximation algorithms for maximum coverage and max cut with given sizes of parts. In: Cornuéjols, G., Burkard, R.E.,Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 17-30. Springer, Heidelberg (1999)
2. Brandes, U.: A faster algorithm for Betweenness Centrality. Journal of Mathematical Sociology 25(2), 163-177 (2001)
3. Brandes, U.: On variants of Shortest-Path Betweenness Centrality and their generic computation. Social Networks 30(2), 136-145 (2008)
4. Dolev, S., Elovici, Y., Puzis, R., Zilberman, P.: Incremental deployment of network monitors based on group betweenness centrality. Information Processing Letters 109(20), 1172-1176 (2009), http://www.sciencedirect.com/ science/article/B6V0F-4X01PFN-1/2/2798e8bf8a2975f8024bcc2f8b8873ac
5. Everett, M., Borgatti, S.: The centrality of groups and classes. Journal of Mathematical Sociology 23, 181-202 (1999)
6. Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM45(4), 634-652 (1998)
7. Freeman, L.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35-41 (1977)
8. Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Information Processing Letters 70, 39-45 (1999)
9. Newman, M.E.J.: Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Physical Review E 64, 16132 (2001)
10. Petrank, E.: The hardness of approximation: Gap location. Computational Complexity 4, 133-157 (1994)
11. Puzis, R., Elovici, Y., Dolev, S.: Finding the most prominent group in complex networks. AI Communications 20(4), 287-296 (2007)
12. Puzis, R., Elovici, Y., Dolev, S.: Fast algorithm for successive computation of group betweenness centrality. Phys. Rev. E 76(5), 56709 (2007)
13. Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Operations Research Letters 32(1), 41-43 (2004)