In this paper, we prove that assuming the exponential time hypothesis (E...
In this paper, we prove that it is W[2]-hard to approximate k-SetCover
w...
In the past a few years, many interesting inapproximability results have...
Given a simple graph G and an integer k, the goal of k-Clique problem
is...
Generalized sorting problem, also known as sorting with forbidden
compar...