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

René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondřej Suchý

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

5 Цитирования (Scopus)

Аннотация

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.

Язык оригиналаанглийский
Страницы (с-по)20-50
Число страниц31
ЖурналDiscrete Optimization
Том30
DOI
СостояниеОпубликовано - 1 ноя 2018

Fingerprint Подробные сведения о темах исследования «The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs». Вместе они формируют уникальный семантический отпечаток (fingerprint).

  • Цитировать