Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses

Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
2013 2013 IEEE 54th Annual Symposium on Foundations of Computer Science  
We present a series of almost settled inapproximability results for three fundamental problems. The first in our series is the subexponential-time inapproximability of the maximum independent set problem, a question studied in the area of parameterized complexity. The second is the hardness of approximating the maximum induced matching problem on bounded-degree bipartite graphs. The last in our series is the tight hardness of approximating the k-hypergraph pricing problem, a fundamental problem
more » ... arising from the area of algorithmic game theory. In particular, assuming the Exponential Time Hypothesis, our two main results are: *
doi:10.1109/focs.2013.47 dblp:conf/focs/ChalermsookLN13 fatcat:wvu3lxve3ba7vey7wa6t67mka4