13 citations · 33 across the 14 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.CC2024
Improved Hardness and Approximations for Cardinality-Based Minimum - Cuts Problems in Hypergraphs
Florian Adriaens, Vedangi Bengali, Iiro Kumpulainen +2
In hypergraphs, an edge that crosses a cut (i.e., a bipartition of nodes) can be split in several ways, depending on how many nodes are placed on each side of the cut. A cardinalit…
cs.DS2024
Multilayer Correlation Clustering
Atsushi Miyauchi, Florian Adriaens, Francesco Bonchi +1
We establish Multilayer Correlation Clustering, a novel generalization of Correlation Clustering to the multilayer setting. In this model, we are given a series of inputs of Correl…