TY - GEN

T1 - Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem

AU - Czeizler, Eugen

AU - Popa, Alexandru

AU - Popescu, Victor

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Recent research has revealed new applications of network control science within bio-medicine, pharmacology, and medical therapeutics. These new insights and new applications generated in turn a rediscovery of some old, unresolved algorithmic questions, this time with a much stronger motivation for their tackling. One of these questions regards the so-called Structural Target Control optimization problem, known in previous literature also as Structural Output Controllability problem. Given a directed network (graph) and a target subset of nodes, the task is to select a small (or the smallest) set of nodes from which the target can be independently controlled, i.e., it can be driven from any given initial configuration to any desired final one, through a finite sequence of input values. In recent work, this problem has been shown to be NP-hard, and several heuristic algorithms were introduced and analyzed, both on randomly generated networks, and on bio-medical ones. In this paper, we show that the Structural Target Controllability problem is fixed parameter tractable when parameterized by the number of target nodes. We also prove that the problem is hard to approximate at a factor better than O(log n).

AB - Recent research has revealed new applications of network control science within bio-medicine, pharmacology, and medical therapeutics. These new insights and new applications generated in turn a rediscovery of some old, unresolved algorithmic questions, this time with a much stronger motivation for their tackling. One of these questions regards the so-called Structural Target Control optimization problem, known in previous literature also as Structural Output Controllability problem. Given a directed network (graph) and a target subset of nodes, the task is to select a small (or the smallest) set of nodes from which the target can be independently controlled, i.e., it can be driven from any given initial configuration to any desired final one, through a finite sequence of input values. In recent work, this problem has been shown to be NP-hard, and several heuristic algorithms were introduced and analyzed, both on randomly generated networks, and on bio-medical ones. In this paper, we show that the Structural Target Controllability problem is fixed parameter tractable when parameterized by the number of target nodes. We also prove that the problem is hard to approximate at a factor better than O(log n).

KW - Approximation algorithms

KW - Fixed parameter algorithms

KW - Protein interaction networks

KW - Structural network control

KW - Systems biology

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

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

U2 - 10.1007/978-3-319-91938-6_9

DO - 10.1007/978-3-319-91938-6_9

M3 - Conference contribution

AN - SCOPUS:85049205513

SN - 9783319919379

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 103

EP - 114

BT - Algorithms for Computational Biology - 5th International Conference, AlCoB 2018, Proceedings

A2 - Martin-Vide, Carlos

A2 - Jansson, Jesper

A2 - Vega-Rodriguez, Miguel A.

PB - Springer Verlag

T2 - 5th International Conference on Algorithms for Computational Biology, AlCoB 2018

Y2 - 25 June 2018 through 26 June 2018

ER -