Hardness of Vertex Deletion and Project Scheduling

Ola Svensson. Hardness of Vertex Deletion and Project Scheduling. Theory of Computing, 9:759-781, 2013. [doi]

Abstract

Abstract is missing.