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

DOI10.1007/s10898-022-01269-2MaRDI QIDQ6183091

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

Publication date: 26 January 2024

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

zbMATH Keywords

randomized algorithmsnetwork analysislinear mixed-integer programmingsample average approximation (SAA)group betweenness centrality

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incremental deployment of network monitors based on Group Betweenness Centrality
• Fast approximation of betweenness centrality through sampling
• A faster algorithm for betweenness centrality*
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Statistical mechanics of complex networks
• Maximum Betweenness Centrality: Approximability and Tractable Cases
• The centrality of groups and classes
• Faster computation of successive bounds on the group betweenness centrality
• KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
• Group Centrality Maximization for Large-scale Graphs
• Finding groups with maximum betweenness centrality
• Collective dynamics of ‘small-world’ networks
• Network Analysis
• Networks

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