The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
Abstract
This work studies the parameterized complexity of finding secluded solutions to classical combinatorial optimization problems on graphs such as finding minimum s-t separators, feedback vertex sets, dominating sets, maximum independent sets, and vertex deletion problems for hereditary graph properties: Herein, one searches not only to minimize or maximize the size of the solution, but also to minimize the size of its neighborhood. This restriction has applications in secure routing and community detection.
Cite
@article{arxiv.1606.09000,
title = {The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs},
author = {René van Bevern and Till Fluschnik and George B. Mertzios and Hendrik Molter and Manuel Sorge and Ondřej Suchý},
journal= {arXiv preprint arXiv:1606.09000},
year = {2019}
}
Comments
Compared to the previous version, this version additionally shows that Small Secluded s-t-Separator is fixed-parameter tractable parameterized by the combination of the solution size and the open neighborhood size (Theorem 3.5). To appear in Discrete Optimization