Sidestepping Barriers for Dominating Set in Parameterized Complexity

Document Type

Conference Proceeding

Publication Date

12-1-2023

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.

Identifier

85180546134 (Scopus)

ISBN

[9783959773058]

Publication Title

Leibniz International Proceedings in Informatics Lipics

External Full Text Location

https://doi.org/10.4230/LIPIcs.IPEC.2023.31

ISSN

18688969

Volume

285

Fund Ref

Bishop Grosseteste University

This document is currently not available here.

Share

COinS