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

Eugen Czeizler, Alexandru Popa, Victor Popescu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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

Original languageEnglish
Title of host publicationAlgorithms for Computational Biology - 5th International Conference, AlCoB 2018, Proceedings
EditorsCarlos Martin-Vide, Jesper Jansson, Miguel A. Vega-Rodriguez
PublisherSpringer Verlag
Pages103-114
Number of pages12
ISBN (Print)9783319919379
DOIs
Publication statusPublished - Jan 1 2018
Event5th International Conference on Algorithms for Computational Biology, AlCoB 2018 - Hong Kong, China
Duration: Jun 25 2018Jun 26 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10849 LNBI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Conference on Algorithms for Computational Biology, AlCoB 2018
CountryChina
CityHong Kong
Period6/25/186/26/18

Keywords

  • Approximation algorithms
  • Fixed parameter algorithms
  • Protein interaction networks
  • Structural network control
  • Systems biology

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem'. Together they form a unique fingerprint.

  • Cite this

    Czeizler, E., Popa, A., & Popescu, V. (2018). Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem. In C. Martin-Vide, J. Jansson, & M. A. Vega-Rodriguez (Eds.), Algorithms for Computational Biology - 5th International Conference, AlCoB 2018, Proceedings (pp. 103-114). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10849 LNBI). Springer Verlag. https://doi.org/10.1007/978-3-319-91938-6_9