Hardness of Vertex Deletion and Project Scheduling

Ola Svensson. Hardness of Vertex Deletion and Project Scheduling. In Anupam Gupta, Klaus Jansen, José D. P. Rolim, Rocco A. Servedio, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings. Volume 7408 of Lecture Notes in Computer Science, pages 301-312, Springer, 2012. [doi]

Abstract

Abstract is missing.