3 papers
cs.DS2025
The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards
Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen +2
We consider a generalization of the densest subhypergraph problem where nonnegative rewards are given for including partial hyperedges in a dense subhypergraph. Prior work addresse…
cs.CC2025
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
On the tractability and approximability of non-submodular cardinality-based - cut problems in hypergraphs
Vedangi Bengali, Nate Veldt
A minimum - cut in a hypergraph is a bipartition of vertices that separates two nodes and while minimizing a hypergraph cut function. The cardinality-based hypergraph…