Main Content

Group Coverage Centrality

A tool developed in Gurobi 10.0 to find a group of exactly k vertices which have the best group coverage centrality and a tool developed in Python 3.10.6 for heuristics to find a group of exactly k vertices with good group coverage centrality.

Download the program here: group-coverage-centrality

If you use our implementation for group coverage centrality in scientific publication, please cite

Christian Komusiewicz, Jannis Schramek and Frank Sommer: On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics. In Proceedings of the 2023 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA'23), Seattle, USA, Mai 2023, to appear.