FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less

Tanmay Inamdar 0002, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan 0001, Saket Saurabh 0001. FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. In Patricia Bouyer, Srikanth Srinivasan 0001, editors, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India. Volume 284 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Abstract

Abstract is missing.