Parameterized algorithms for the Steiner arborescence problem on a hypercube
Motivated by a phylogeny reconstruction problem in evolutionary biology, we study the minimum Steiner arborescence problem on directed hypercubes (MSA-DH). Given m, representing the directed hypercube Q→m, and a set of terminals R, the problem asks to find a Steiner arborescence that spans R with mi...
Saved in:
| Published in: | Acta informatica Vol. 62; no. 1; p. 6 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Heidelberg
Springer Nature B.V
01.03.2025
|
| Subjects: | |
| ISSN: | 0001-5903, 1432-0525 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Motivated by a phylogeny reconstruction problem in evolutionary biology, we study the minimum Steiner arborescence problem on directed hypercubes (MSA-DH). Given m, representing the directed hypercube Q→m, and a set of terminals R, the problem asks to find a Steiner arborescence that spans R with minimum cost. As m implicitly represents Q→m comprising 2m vertices, the running time analyses of traditional Steiner tree algorithms on general graphs does not give a clear understanding of the actual complexity of this problem. We present algorithms that exploit the structure of the hypercube and run in FPT time. We explore the MSA-DH problem on three natural parameters—|R|, and two above-guarantee parameters, number of Steiner nodes p and penalty q (defined as the extra cost above m incurred by the solution). For above-guarantee parameters, the parameterized MSA-DH problem take p≥0 or q≥0 as input, and outputs a Steiner arborescence with at most |R|+p-1 or m+q edges respectively. We present the following results (O~ hides the polynomial factors): An exact algorithm that runs in O~(3|R|) time.A randomized algorithm that runs in O~(9q) time with success probability ≥4-q.An exact algorithm that runs in O~(36q) time.A (1+q)-approximation algorithm that runs in O~(1.25284q) time.An Opℓmax-additive approximation algorithm that runs in O~(ℓmaxp+2) time, where ℓmax is the maximum distance of any terminal from the root. |
|---|---|
| AbstractList | Motivated by a phylogeny reconstruction problem in evolutionary biology, we study the minimum Steiner arborescence problem on directed hypercubes (MSA-DH). Given m, representing the directed hypercube Q→m, and a set of terminals R, the problem asks to find a Steiner arborescence that spans R with minimum cost. As m implicitly represents Q→m comprising 2m vertices, the running time analyses of traditional Steiner tree algorithms on general graphs does not give a clear understanding of the actual complexity of this problem. We present algorithms that exploit the structure of the hypercube and run in FPT time. We explore the MSA-DH problem on three natural parameters—|R|, and two above-guarantee parameters, number of Steiner nodes p and penalty q (defined as the extra cost above m incurred by the solution). For above-guarantee parameters, the parameterized MSA-DH problem take p≥0 or q≥0 as input, and outputs a Steiner arborescence with at most |R|+p-1 or m+q edges respectively. We present the following results (O~ hides the polynomial factors): An exact algorithm that runs in O~(3|R|) time.A randomized algorithm that runs in O~(9q) time with success probability ≥4-q.An exact algorithm that runs in O~(36q) time.A (1+q)-approximation algorithm that runs in O~(1.25284q) time.An Opℓmax-additive approximation algorithm that runs in O~(ℓmaxp+2) time, where ℓmax is the maximum distance of any terminal from the root. |
| ArticleNumber | 6 |
| Author | Narayanan, Manikandan Narayanaswamy, N. S. Mahapatra, Sugyani |
| Author_xml | – sequence: 1 givenname: Sugyani surname: Mahapatra fullname: Mahapatra, Sugyani – sequence: 2 givenname: Manikandan surname: Narayanan fullname: Narayanan, Manikandan – sequence: 3 givenname: N. S. surname: Narayanaswamy fullname: Narayanaswamy, N. S. |
| BookMark | eNotkE1LAzEYhINUsFb_gKeA52jefGyyRyl-QUFBPYck-8Zu6e7WZHuov97VehoGhpnhOSezfuiRkCvgN8C5uS2cC1kxLhTjXBnF7AmZg5KCcS30jMw558B0zeUZOS9lM1kjJMzJ6tVn3-GIuf3Ghvrt55Dbcd0VmoZMxzXStxHbHjP1OQwZS8Q-It3lIWyxo0NPPV0fdpjjPuAFOU1-W_DyXxfk4-H-ffnEVi-Pz8u7FYugq5Fpa0BHESdnjErKV75WEoQG6X2jhK90sAm0stDUQaWEwYZQxwZMhYlXckGuj73Tja89ltFthn3up0knQUFtjLZ2SoljKuahlIzJ7XLb-XxwwN0vNXek5iZq7o-as_IHhHthlw |
| Cites_doi | 10.1016/S0196-8858(82)80004-3 10.1007/s10878-005-5487-0 10.1090/S0273-0979-1980-14848-X 10.1007/11786986_58 10.1007/11415770_17 10.1089/cmb.2006.13.522 10.1137/1.9781611976465.132 10.1109/TCBB.2007.1070 10.1016/S0166-218X(98)00069-9 10.1007/978-3-319-21275-3 10.1089/cmb.2009.0249 10.1007/BF02523690 10.1007/978-3-642-32512-0_3 10.1145/780542.780628 10.1093/acprof:oso/9780198566076.001.0001 10.1007/11415770_44 10.1137/18M1209489 10.1016/0025-5564(86)90161-6 10.1007/s00453-012-9630-x 10.1002/net.3230010302 10.1007/978-3-642-27848-8_112-2 10.2307/2406441 |
| ContentType | Journal Article |
| Copyright | Copyright Springer Nature B.V. Mar 2025 |
| Copyright_xml | – notice: Copyright Springer Nature B.V. Mar 2025 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1007/s00236-024-00474-8 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1432-0525 |
| ExternalDocumentID | 10_1007_s00236_024_00474_8 |
| GroupedDBID | -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 2.D 203 23M 28- 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6J9 6NX 78A 7WY 8AO 8FE 8FG 8FL 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX ABAKF ABBBX ABBRH ABBXA ABDBE ABDBF ABDPE ABDZT ABECU ABFSG ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFO ACGFS ACHSB ACHXU ACIHN ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACREN ACSTC ACUHS ACZOJ ADHHG ADHIR ADHKG ADIMF ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEAQA AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFFHD AFGCZ AFHIU AFKRA AFLOW AFOHR AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMVHM AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN AZQEC B-. B0M BA0 BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU CITATION COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DWQXO EAD EAP EBLON EBS ECS EDO EIOEI EJD EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW LAS LLZTM M0C M4Y MA- MK~ N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PHGZM PHGZT PQBIZ PQBZA PQGLB PQQKQ PROAC PT4 PT5 Q2X QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 YLTOR Z45 ZCA ZMTXR ~8M ~EX 7SC 8FD AESKC JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c156t-58715c2cc15774f4a6a94312513aad42a65b8f15481d9b4ffeb8bb9cd176ef063 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001372476600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0001-5903 |
| IngestDate | Wed Nov 05 14:50:29 EST 2025 Sat Nov 29 08:05:07 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c156t-58715c2cc15774f4a6a94312513aad42a65b8f15481d9b4ffeb8bb9cd176ef063 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 3141977588 |
| PQPubID | 47313 |
| ParticipantIDs | proquest_journals_3141977588 crossref_primary_10_1007_s00236_024_00474_8 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-03-00 20250301 |
| PublicationDateYYYYMMDD | 2025-03-01 |
| PublicationDate_xml | – month: 03 year: 2025 text: 2025-03-00 |
| PublicationDecade | 2020 |
| PublicationPlace | Heidelberg |
| PublicationPlace_xml | – name: Heidelberg |
| PublicationTitle | Acta informatica |
| PublicationYear | 2025 |
| Publisher | Springer Nature B.V |
| Publisher_xml | – name: Springer Nature B.V |
| References | F Lam (474_CR20) 2010; 17 474_CR16 474_CR17 VV Vazirani (474_CR24) 2013 WH Day (474_CR6) 1986; 81 474_CR14 474_CR15 D Fernández-Baca (474_CR12) 1998; 88 J Nederlof (474_CR21) 2013; 65 474_CR19 M Cygan (474_CR5) 2015 R Niedermeier (474_CR22) 2006 474_CR3 474_CR2 474_CR1 Z Ding (474_CR8) 2006; 13 SE Dreyfus (474_CR9) 1971; 1 474_CR7 S Sridhar (474_CR23) 2007; 4 TS Hsu (474_CR18) 2005; 9 A Zelikovsky (474_CR25) 1997; 18 LR Foulds (474_CR13) 1982; 3 JH Camin (474_CR4) 1965; 19 P Dvorák (474_CR10) 2021; 35 J Felsenstein (474_CR11) 2004 |
| References_xml | – volume: 3 start-page: 43 issue: 1 year: 1982 ident: 474_CR13 publication-title: Adv. Appl. Math. doi: 10.1016/S0196-8858(82)80004-3 – volume: 9 start-page: 101 issue: 1 year: 2005 ident: 474_CR18 publication-title: J. Combin. Optim. doi: 10.1007/s10878-005-5487-0 – volume-title: Approximation Algorithms year: 2013 ident: 474_CR24 – ident: 474_CR3 doi: 10.1090/S0273-0979-1980-14848-X – ident: 474_CR2 doi: 10.1007/11786986_58 – ident: 474_CR15 doi: 10.1007/11415770_17 – volume: 13 start-page: 522 issue: 2 year: 2006 ident: 474_CR8 publication-title: J. Comput. Biol. doi: 10.1089/cmb.2006.13.522 – ident: 474_CR14 doi: 10.1137/1.9781611976465.132 – volume: 4 start-page: 561 issue: 4 year: 2007 ident: 474_CR23 publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. doi: 10.1109/TCBB.2007.1070 – volume: 88 start-page: 129 issue: 1–3 year: 1998 ident: 474_CR12 publication-title: Discrete Appl. Math. doi: 10.1016/S0166-218X(98)00069-9 – volume-title: Inferring Phylogenies year: 2004 ident: 474_CR11 – volume-title: Parameterized Algorithms year: 2015 ident: 474_CR5 doi: 10.1007/978-3-319-21275-3 – volume: 17 start-page: 767 issue: 6 year: 2010 ident: 474_CR20 publication-title: J. Comput. Biol. doi: 10.1089/cmb.2009.0249 – volume: 18 start-page: 99 issue: 1 year: 1997 ident: 474_CR25 publication-title: Algorithmica doi: 10.1007/BF02523690 – ident: 474_CR1 doi: 10.1007/978-3-642-32512-0_3 – ident: 474_CR16 doi: 10.1145/780542.780628 – volume-title: Invitation to Fixed-Parameter Algorithms year: 2006 ident: 474_CR22 doi: 10.1093/acprof:oso/9780198566076.001.0001 – ident: 474_CR7 doi: 10.1007/11415770_44 – volume: 35 start-page: 546 issue: 1 year: 2021 ident: 474_CR10 publication-title: SIAM J. Discrete Math. doi: 10.1137/18M1209489 – volume: 81 start-page: 33 issue: 1 year: 1986 ident: 474_CR6 publication-title: Math. Biosci. doi: 10.1016/0025-5564(86)90161-6 – volume: 65 start-page: 868 issue: 4 year: 2013 ident: 474_CR21 publication-title: Algorithmica doi: 10.1007/s00453-012-9630-x – volume: 1 start-page: 195 issue: 3 year: 1971 ident: 474_CR9 publication-title: Networks doi: 10.1002/net.3230010302 – ident: 474_CR19 doi: 10.1007/978-3-642-27848-8_112-2 – volume: 19 start-page: 311 issue: 3 year: 1965 ident: 474_CR4 publication-title: Evolution doi: 10.2307/2406441 – ident: 474_CR17 |
| SSID | ssj0007231 |
| Score | 2.3540049 |
| Snippet | Motivated by a phylogeny reconstruction problem in evolutionary biology, we study the minimum Steiner arborescence problem on directed hypercubes (MSA-DH).... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Index Database |
| StartPage | 6 |
| SubjectTerms | Algorithms Apexes Approximation Evolutionary algorithms Graphical representations Hypercubes Minimum cost Parameterization Parameters Polynomials |
| Title | Parameterized algorithms for the Steiner arborescence problem on a hypercube |
| URI | https://www.proquest.com/docview/3141977588 |
| Volume | 62 |
| WOSCitedRecordID | wos001372476600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1432-0525 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007231 issn: 0001-5903 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1BS8MwFH6M4UEPTqfidEoO3jTQtEmbHkUcHmQMp7JbSZrEDXSTrvPgr_el64YDPeyc8ihf8pLvkZfvA7iymD-B1jHFYSxQVCRoKnRIWcR1rJUTwpnKbCLp9-VolA4acPPvDb6X-wwj3yjLqZc25NS_7GVx6O0Knoav6203CaPaHo9RkQZR_ULm7xCbp9DmJlydLL3Wdv90APs1gyS3yyk_hIadtqG1cmcgdbK2Ye-X1OARPA6Ub8Pyyszf1hD1_jYrJuX4Y06QtRJkgWTofS8xgCpwWVQiT7kltd8MmU2JImOsWYt8oe0xvPTun-8eaO2kQHOsz0oqsCwSeYjTIZDuOa5ilSJzQG4TKWV4qGKhpfPVCzOp5s5ZLbVOc8OS2DpkMSfQnM6m9hQIy7lJpAqkEZwrgZ_b1CVWJ0gcTGKDDlyvkM0-l4IZ2VoauYItQ9iyCrZMdqC7Aj-rk2eeRYwzpKVCyrOtgp3DbujdeasOsS40y2JhL2An_yon8-KyWi0_Y122gQ |
| linkProvider | Springer Nature |
| 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=Parameterized+algorithms+for+the+Steiner+arborescence+problem+on+a+hypercube&rft.jtitle=Acta+informatica&rft.date=2025-03-01&rft.pub=Springer+Nature+B.V&rft.issn=0001-5903&rft.eissn=1432-0525&rft.volume=62&rft.issue=1&rft.spage=6&rft_id=info:doi/10.1007%2Fs00236-024-00474-8&rft.externalDBID=HAS_PDF_LINK |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0001-5903&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0001-5903&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0001-5903&client=summon |