Advances in Exact and Approximate Group Closeness Centrality Maximization

Christian Schulz, Jakob Ternes, Henning Woydt

In the NP-hard Group Closeness Centrality Maximization problem, the input is a graph $G=(V,E)$ and a positive integer $k$, and the task is to find a set $S\subseteq V$ of size $…