Finding groups with maximum betweenness centrality via integer programming with random path sampling

DOI10.1007/S10898-022-01269-2MaRDI QIDQ6183091FDOQ6183091

Authors: Tomás Lagos, Oleg A. Prokopyev, Alexander Veremyev 

Publication date: 26 January 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

Recommendations

• Finding groups with maximum betweenness centrality
• An integer programming approach for finding the most and the least central cliques
• Finding clique clusters with the highest betweenness centrality
• scientific article; zbMATH DE number 5663542
• Scaling up group closeness maximization

zbMATH Keywords

network analysisrandomized algorithmslinear mixed-integer programmingsample average approximation (SAA)group betweenness centrality

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Statistical mechanics of complex networks
• Collective dynamics of `small-world' networks
• Networks. An introduction.
• The centrality of groups and classes
• A faster algorithm for betweenness centrality*
• The sample average approximation method for stochastic discrete optimization
• Social and economic networks.
• Lectures on stochastic programming. Modeling and theory.
• Network Analysis
• Maximum betweenness centrality: approximability and tractable cases
• Finding groups with maximum betweenness centrality
• Incremental deployment of network monitors based on Group Betweenness Centrality
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Fast approximation of betweenness centrality through sampling
• KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
• Faster computation of successive bounds on the group betweenness centrality
• Group Centrality Maximization for Large-scale Graphs

Cited In (2)

• The parameterized complexity of maximum betweenness centrality
• A survey on optimization studies of group centrality metrics

This page was built for publication: Finding groups with maximum betweenness centrality via integer programming with random path sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183091)