On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

Spoorthy Gunda, Pallavi Jain 0001, Daniel Lokshtanov, Saket Saurabh 0001, Prafullkumar Tale. On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. In Jaroslaw Byrka, Raghu Meka, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference. Volume 176 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: