Reproduce “Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Nate Veldt, Anthony Wirth, David F. Gleich
The authors extend parameterized correlation clustering to hypergraphs and bipartite graphs, where parameters tune penalties for splitting related items or grouping unrelated ones. HyperLam represents multiway links with selectable cut penalties, while PBCC generalizes bipartite clustering objectives. The work proves a 4-approximation for bicluster deletion and identifies a regime solved exactly by maximum bipartite matching; however, PBCC remains NP-hard generally.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.