Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan 0001, Saket Saurabh 0001, Meirav Zehavi. FPT-approximation for FPT Problems. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 199-218, SIAM, 2022. [doi]
@inproceedings{LokshtanovM00Z22,
title = {FPT-approximation for FPT Problems},
author = {Daniel Lokshtanov and Pranabendu Misra and M. S. Ramanujan 0001 and Saket Saurabh 0001 and Meirav Zehavi},
year = {2022},
doi = {10.1137/1.9781611976465.14},
url = {https://doi.org/10.1137/1.9781611976465.14},
researchr = {https://researchr.org/publication/LokshtanovM00Z22},
cites = {0},
citedby = {0},
pages = {199-218},
booktitle = {Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022},
editor = {Joseph (Seffi) Naor and Niv Buchbinder},
publisher = {SIAM},
isbn = {978-1-61197-707-3},
}