Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems

Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi. Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. In Eric Blais, Klaus Jansen, José D. P. Rolim, David Steurer, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA. Volume 116 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Abstract

Abstract is missing.