Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem

Recent research has revealed new and unexpected applications of network control science within biomedicine, pharmacology, and medical therapeutics. These new insights and new applications generated in turn a rediscovery of some old, unresolved algorithmic problems. One of these problems is the Struc...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Scientific annals of computer science Ročník XXXII; číslo 1; s. 109 - 136
Hlavní autoři: Czeizler, Eugen, Popa, Alexandru, Popescu, Victor
Médium: Journal Article
Jazyk:angličtina
Vydáno: 22.06.2022
ISSN:1843-8121, 2248-2695
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Recent research has revealed new and unexpected applications of network control science within biomedicine, pharmacology, and medical therapeutics. These new insights and new applications generated in turn a rediscovery of some old, unresolved algorithmic problems. One of these problems is the Structural Target Control optimization problem, known in previous literature also as Structural Output Controllability problem, which is defined as follows. Given a directed network 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., there exists a set of paths from the selected set of nodes (called driver nodes) to the target nodes such that no two paths intersect at the same distance from their targets. Recently, Structural Target Control optimization problem has been shown to be NP-hard, and several heuristic algorithms were introduced and analyzed, both on randomly generated networks, and on biomedical 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). Taking into consideration the real case formulations of this problem we identify two more parameters which are naturally constrained by smaller bounds: the maximal length of a controlling path and the size of the set of nodes from which the control can start. With these new parameters we provide an approximation algorithm which is of exponential complexity in the size of the set of nodes from which the control can start and polynomial in all the other parameters.
AbstractList Recent research has revealed new and unexpected applications of network control science within biomedicine, pharmacology, and medical therapeutics. These new insights and new applications generated in turn a rediscovery of some old, unresolved algorithmic problems. One of these problems is the Structural Target Control optimization problem, known in previous literature also as Structural Output Controllability problem, which is defined as follows. Given a directed network 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., there exists a set of paths from the selected set of nodes (called driver nodes) to the target nodes such that no two paths intersect at the same distance from their targets. Recently, Structural Target Control optimization problem has been shown to be NP-hard, and several heuristic algorithms were introduced and analyzed, both on randomly generated networks, and on biomedical 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). Taking into consideration the real case formulations of this problem we identify two more parameters which are naturally constrained by smaller bounds: the maximal length of a controlling path and the size of the set of nodes from which the control can start. With these new parameters we provide an approximation algorithm which is of exponential complexity in the size of the set of nodes from which the control can start and polynomial in all the other parameters.
Author Popescu, Victor
Czeizler, Eugen
Popa, Alexandru
Author_xml – sequence: 1
  givenname: Eugen
  orcidid: 0000-0002-1607-1554
  surname: Czeizler
  fullname: Czeizler, Eugen
– sequence: 2
  givenname: Alexandru
  orcidid: 0000-0003-3364-1210
  surname: Popa
  fullname: Popa, Alexandru
– sequence: 3
  givenname: Victor
  surname: Popescu
  fullname: Popescu, Victor
BookMark eNotkMFrwjAYxcNwMOc875p_oLVJW5scS5nbQJhM7yVNvmhH2siXCPrfr7K9y-O9w-Pxeyaz0Y9AyCvL0qpcs9W-bvYpzzhPecoy-UDmnBci4WtZzsiciSJPBOPsiSxD-Mkm5bIQMp8T3PRXMHSnUA0QAWntjh77eBoCVaOhHwrNCCFQb2l9PqO_9oOKvR_pN4SLi4FajzSegO4jXnS8oHL0oPAIkTZ-jOidU13v-nijO_Sdg-GFPFrlAiz_fUEOm7dD85Fsv94_m3qbaMFkwnTZ5TxTUlgrOluZYs2YyAQUtqik0VDlHZSWl5x1zFqlmVYGhDBTkgpUviCrv1mNPgQE255x-o63lmXtHVp7h9beobV86mT-C_1qZO0
ContentType Journal Article
CorporateAuthor Abo Akademi University, Turku, Finland
University of Bucharest, Romania
CorporateAuthor_xml – name: Abo Akademi University, Turku, Finland
– name: University of Bucharest, Romania
DBID AAYXX
CITATION
DOI 10.7561/SACS.2022.2.109
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2248-2695
EndPage 136
ExternalDocumentID 10_7561_SACS_2022_2_109
GroupedDBID .4S
.DC
2WC
5VS
8FE
8FG
8R4
8R5
AAFWJ
AAKPC
AAYXX
ABUWG
ADBBV
AFFHD
AFKRA
AFPKN
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARAPS
ARCSS
AZQEC
BCNDV
BENPR
BGLVJ
BPHCQ
BYOGL
CCPQU
CITATION
DWQXO
E3Z
EDO
EOJEC
FRP
GNUQQ
GROUPED_DOAJ
HCIFZ
K6V
K7-
KQ8
MK~
ML~
OBODZ
OK1
P62
PHGZM
PHGZT
PQGLB
PQQKQ
PROAC
Q2X
RNS
TUS
ID FETCH-LOGICAL-c819-1c5b320a98ff8bf7d4611808e4f479dce73be5f2521b1ffac1cade88db1f9aea3
ISSN 1843-8121
IngestDate Sat Nov 29 05:23:09 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c819-1c5b320a98ff8bf7d4611808e4f479dce73be5f2521b1ffac1cade88db1f9aea3
ORCID 0000-0002-1607-1554
0000-0003-3364-1210
OpenAccessLink https://www.info.uaic.ro/wp-content/uploads/2022/06/XXXII1_3-1.pdf
PageCount 28
ParticipantIDs crossref_primary_10_7561_SACS_2022_2_109
PublicationCentury 2000
PublicationDate 2022-06-22
PublicationDateYYYYMMDD 2022-06-22
PublicationDate_xml – month: 06
  year: 2022
  text: 2022-06-22
  day: 22
PublicationDecade 2020
PublicationTitle Scientific annals of computer science
PublicationYear 2022
SSID ssj0000394893
Score 2.2026427
Snippet Recent research has revealed new and unexpected applications of network control science within biomedicine, pharmacology, and medical therapeutics. These new...
SourceID crossref
SourceType Index Database
StartPage 109
Title Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem
Volume XXXII
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2248-2695
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000394893
  issn: 1843-8121
  databaseCode: DOA
  dateStart: 20070101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 2248-2695
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000394893
  issn: 1843-8121
  databaseCode: P5Z
  dateStart: 20070101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 2248-2695
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000394893
  issn: 1843-8121
  databaseCode: K7-
  dateStart: 20070101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: East Europe, Central Europe Database (ProQuest)
  customDbUrl:
  eissn: 2248-2695
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000394893
  issn: 1843-8121
  databaseCode: BYOGL
  dateStart: 20070101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/eastcentraleurope
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2248-2695
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000394893
  issn: 1843-8121
  databaseCode: BENPR
  dateStart: 20070101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Ni9swEBXptode-l3abbvo0EOhKLVlx7aOYenSpbAENgffjCRLW4PrLE6yhP1X_Yc7I9mOm1LYHnoxiZPIjueheSPNvCHkY6TAyWuhmCwlZ7GJLFNJyVmSlcB_Z6GxWrtmE-nFRZbnYjGZ_OprYW7qtGmy3U5c_1dTwzkwNpbO_oO5h0HhBLwGo8MRzA7Hexn-rNoBiVxIzLpCBcR5fbVqq82Pn16NGbfq3fTmKWi72lW-ehFX8rf1Zj0kHl46aVkny7F0-eJYHoh57bXX9sbaQteNZkxw3Vzh8o_gar02s-5aR3zu_O2w8XFrqtu6r7i52lelLSCUH5XftNvRB2atty47t9JeKXlYtYCAN0gYHy1kYpsZBuTC48q4c8AmwJSJb7rZz855np-f_wFEP9uGgRg57tArqRz6hBQYIu5Kz08vp3gnUz4dfjdW3z7wikOuIkRJOESBAxQ4QMFx2_4BecjTmUBf8D1lw7JeEAmU88Ewv_-HXlAKx_hycBMjLjQiNctn5EkXjdC5R9FzMjHNC_K07_RBu4n_JWkdqOgAKroHFQX70B5UdGXpb6CiHagogIoCqOgeVNSDih6AinagekWWZ1-Xp99Y162DaWCVLNQzFfFAiszaTNm0jBNUF8xMbONUlNqkkTIzy4EuqtBaqUOs_8iyEt4JaWT0mhw1q8a8IVQGqBsQlJHmZVyGUnKISaJMAdnlMlDRW_Kpf2zFtddkKf5ipeP7f_UdebwH6ntyBI_DfCCP9M2mWrcnbq3mxNn6DpNAick
linkProvider ProQuest
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fixed+Parameter+Algorithms+and+Hardness+of+Approximation+Results+for+the+Structural+Target+Controllability+Problem&rft.jtitle=Scientific+annals+of+computer+science&rft.au=Czeizler%2C+Eugen&rft.au=Popa%2C+Alexandru&rft.au=Popescu%2C+Victor&rft.date=2022-06-22&rft.issn=1843-8121&rft.eissn=2248-2695&rft.volume=XXXII&rft.issue=1&rft.spage=109&rft.epage=136&rft_id=info:doi/10.7561%2FSACS.2022.2.109&rft.externalDBID=n%2Fa&rft.externalDocID=10_7561_SACS_2022_2_109
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1843-8121&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1843-8121&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1843-8121&client=summon