FPT approximation and subexponential algorithms for covering few or many edges

Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana

Abstract: Highlights•Fixed-Cardinality Graph Partitioning (FCGP) is a large class of problems.•Many interesting problems are special cases.•We extend degree arguments used for Partial Vertex Cover to Max/Min FCGP.•FPT approximation algorithms in general graphs.•Subexponential FPT algorithms in special graph families.