Standard

The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. / van Bevern, René; Fluschnik, Till; Mertzios, George B. и др.

в: Discrete Optimization, Том 30, 01.11.2018, стр. 20-50.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

van Bevern, R, Fluschnik, T, Mertzios, GB, Molter, H, Sorge, M & Suchý, O 2018, 'The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs', Discrete Optimization, Том. 30, стр. 20-50. https://doi.org/10.1016/j.disopt.2018.05.002

APA

van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M., & Suchý, O. (2018). The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discrete Optimization, 30, 20-50. https://doi.org/10.1016/j.disopt.2018.05.002

Vancouver

van Bevern R, Fluschnik T, Mertzios GB, Molter H, Sorge M, Suchý O. The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discrete Optimization. 2018 нояб. 1;30:20-50. doi: 10.1016/j.disopt.2018.05.002

Author

van Bevern, René ; Fluschnik, Till ; Mertzios, George B. и др. / The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. в: Discrete Optimization. 2018 ; Том 30. стр. 20-50.

BibTeX

@article{c7ba6ada335c475fa012530c817d4c9c,
title = "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 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.",
keywords = "Dominating set, Feedback vertex set, Neighborhood, Separator, Vertex deletion, KERNEL, SET, VERTEX, ENUMERATION, SEPARATION",
author = "{van Bevern}, Ren{\'e} and Till Fluschnik and Mertzios, {George B.} and Hendrik Molter and Manuel Sorge and Ond{\v r}ej Such{\'y}",
note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",
year = "2018",
month = nov,
day = "1",
doi = "10.1016/j.disopt.2018.05.002",
language = "English",
volume = "30",
pages = "20--50",
journal = "Discrete Optimization",
issn = "1572-5286",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs

AU - van Bevern, René

AU - Fluschnik, Till

AU - Mertzios, George B.

AU - Molter, Hendrik

AU - Sorge, Manuel

AU - Suchý, Ondřej

N1 - Publisher Copyright: © 2018 Elsevier B.V.

PY - 2018/11/1

Y1 - 2018/11/1

N2 - 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 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.

AB - 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 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.

KW - Dominating set

KW - Feedback vertex set

KW - Neighborhood

KW - Separator

KW - Vertex deletion

KW - KERNEL

KW - SET

KW - VERTEX

KW - ENUMERATION

KW - SEPARATION

UR - http://www.scopus.com/inward/record.url?scp=85048565401&partnerID=8YFLogxK

U2 - 10.1016/j.disopt.2018.05.002

DO - 10.1016/j.disopt.2018.05.002

M3 - Article

AN - SCOPUS:85048565401

VL - 30

SP - 20

EP - 50

JO - Discrete Optimization

JF - Discrete Optimization

SN - 1572-5286

ER -

ID: 14047689