FPT-approximation for FPT Problems

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Journal title: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)

Journal publisher: Society for Industrial and Applied Mathematics

Published year: 2021

Published pages: 199-218

DOI identifier: 10.1137/1.9781611976465.14

ISBN: 978-1-61197-646-5