IMSc Webinar

FPT-Approximation for Partial Hitting Set Problems

Souvik Saha

IMSc

In this thesis we study FPT approximation for the partial version of classical d-Hitting Set problems. These problems are known to be W[1]-hard even when d=2. In this thesis we survey results around these problems.