1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
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.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.DS2023★ 1 cited
Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling
Vedangi Bengali, Nate Veldt
Graph clustering is a fundamental task in network analysis where the goal is to detect sets of nodes that are well-connected to each other but sparsely connected to the rest of the…