69 citations · 180 across the 32 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
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…
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★ 2 cited
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
Vicente Balmaseda, Ying Xu, Yixin Cao +1
Cluster deletion is an NP-hard graph clustering objective with applications in computational biology and social network analysis, where the goal is to delete a minimum number of ed…