62 citations · 81 across the 22 of their papers we have counts for
3 papers · 1 filter
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…
Graph Clustering in All Parameter Regimes
Junhao Gan, David F. Gleich, Nate Veldt +2
Resolution parameters in graph clustering represent a size and quality trade-off. We address the task of efficiently solving a parameterized graph clustering objective for all valu…
Correlation Clustering Generalized
David F. Gleich, Nate Veldt, Anthony Wirth
We present new results for LambdaCC and MotifCC, two recently introduced variants of the well-studied correlation clustering problem. Both variants are motivated by applications to…