Solving Target Set Selection with Bounded Thresholds Faster than 2^n

Ivan Bliznets, Danil Sagunov. Solving Target Set Selection with Bounded Thresholds Faster than 2^n. In Christophe Paul, Michal Pilipczuk, editors, 13th International Symposium on Parameterized and Exact Computation, IPEC 2018, August 20-24, 2018, Helsinki, Finland. Volume 115 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Abstract

Abstract is missing.