5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DS2017★ 5 cited
Improved approximation algorithm for the Dense-3-Subhypergraph Problem
Amey Bhangale, Rajiv Gandhi, Guy Kortsarz
The study of Dense--Subhypergraph problem was initiated in Chlamt{á}c et al. [Approx'16]. The input is a universe and collection of subsets of , each of size $…
cs.DS2013
Edge covering with budget constrains
Rajiv Gandhi, G. Kortsarz
We study two related problems: finding a set of k vertices and minimum number of edges (kmin) and finding a graph with at least m' edges and minimum number of vertices (mvms). Gold…