Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
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 and a positive integer , and the task is to find a set of size $…
cs.DS2025
Near-Optimal Minimum Cuts in Hypergraphs at Scale
Adil Chhabra, Christian Schulz, Bora Uçar +1
The hypergraph minimum cut problem aims to partition its vertices into two blocks while minimizing the total weight of the cut hyperedges. This fundamental problem arises in networ…