@inproceedings{b4847648e42d41d291f35169deae925a,
title = "Sidestepping Barriers for Dominating Set in Parameterized Complexity",
abstract = "We study the classic Dominating Set problem with respect to several prominent parameters. Specifically, we present algorithmic results that sidestep time complexity barriers by the incorporation of either approximation or larger parameterization. Our results span several parameterization regimes, including: (i,ii,iii) time/ratio-tradeoff for the parameters treewidth, vertex modulator to constant treewidth and solution size; (iv,v) FPT-algorithms for the parameters vertex cover number and feedback edge set number; and (vi) compression for the parameter feedback edge set number.",
keywords = "Approximation Algorithms, Dominating Set, Parameterized Complexity",
author = "Ioannis Koutis and Micha{\l} W{\l}odarczyk and Meirav Zehavi",
note = "Publisher Copyright: {\textcopyright} 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.; 18th International Symposium on Parameterized and Exact Computation, IPEC 2023 ; Conference date: 06-09-2023 Through 08-09-2023",
year = "2023",
month = dec,
day = "1",
doi = "https://doi.org/10.4230/LIPIcs.IPEC.2023.31",
language = "American English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Neeldhara Misra and Magnus Wahlstrom",
booktitle = "18th International Symposium on Parameterized and Exact Computation, IPEC 2023",
address = "Germany",
}