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]
@inproceedings{AgrawalLM0Z18-0,
title = {Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems},
author = {Akanksha Agrawal and Daniel Lokshtanov and Pranabendu Misra and Saket Saurabh 0001 and Meirav Zehavi},
year = {2018},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.1},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.1},
researchr = {https://researchr.org/publication/AgrawalLM0Z18-0},
cites = {0},
citedby = {0},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA},
editor = {Eric Blais and Klaus Jansen and José D. P. Rolim and David Steurer},
volume = {116},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-085-9},
}