11 citations · 32 across the 20 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
Parinya Chalermsook, Marek Cygan, Guy Kortsarz +4
We consider questions that arise from the intersection between the areas of polynomial-time approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable…
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 $…