{"id":"https://openalex.org/W7157738450","doi":"https://doi.org/10.48550/arxiv.2604.25585","title":"New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph","display_name":"New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph","publication_year":2026,"publication_date":"2026-04-28","ids":{"openalex":"https://openalex.org/W7157738450","doi":"https://doi.org/10.48550/arxiv.2604.25585"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.25585","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.25585","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.25585","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5098849103","display_name":"Afrouz Jabal Ameli","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ameli, Afrouz Jabal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088434500","display_name":"Tomohiro Koana","orcid":"https://orcid.org/0000-0002-8684-0611"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Koana, Tomohiro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134833301","display_name":"Jesper Nederlof","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nederlof, Jesper","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134858792","display_name":"Shengzhe Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Shengzhe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6930000185966492,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6930000185966492,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.07989999651908875,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.0658000037074089,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.7493000030517578},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5945000052452087},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5907999873161316},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5619999766349792},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5006999969482422},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.47839999198913574},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.45750001072883606},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.42739999294281006},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4172999858856201},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.4058000147342682}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.7493000030517578},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6833000183105469},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6668999791145325},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5945000052452087},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5907999873161316},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5619999766349792},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5006999969482422},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.47839999198913574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46619999408721924},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.45750001072883606},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.42739999294281006},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4172999858856201},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4058000147342682},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4000999927520752},{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.38199999928474426},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.3720000088214874},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35440000891685486},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3508000075817108},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.3425999879837036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3330000042915344},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32839998602867126},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.326200008392334},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3197999894618988},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31540000438690186},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.3052000105381012},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.30390000343322754},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.2957000136375427},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.2858000099658966},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.2818000018596649},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.2815999984741211},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2797999978065491},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.27889999747276306},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.275299996137619},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.25585","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.25585","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.25585","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.25585","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Strongly":[1,162],"Connected":[2,163],"Steiner":[3],"Subgraph":[4,165],"(SCSS)":[5],"problem":[6,12,95,166],"is":[7,72,83],"a":[8,16,22,62,77,94,137,146,169],"well-studied":[9],"network":[10],"design":[11],"that":[13,19,46,106,132,158],"asks":[14],"for":[15,38,93,117],"minimum":[17],"subgraph":[18],"strongly":[20],"connects":[21],"given":[23],"set":[24],"of":[25,65,69,90,145],"terminals.":[26],"In":[27,154],"this":[28,88],"paper,":[29],"we":[30,44,100,122,156],"present":[31],"several":[32],"new":[33],"algorithmic":[34],"and":[35,82],"complexity":[36],"results":[37],"SCSS.":[39],"As":[40],"our":[41],"main":[42],"result,":[43],"show":[45,157],"SCSS":[47,108,133],"can":[48],"be":[49],"solved":[50],"in":[51,109],"time":[52,80,92],"$17^{\\mathrm{tw}}":[53],"n^{O(1)}$":[54,111],"on":[55],"directed":[56,119],"graphs":[57],"with":[58,87,125],"$n$":[59],"vertices":[60],"when":[61,140],"tree":[63],"decomposition":[64],"the":[66,84,114,143,150,159,173],"underlying":[67],"graph":[68],"width":[70],"$\\mathrm{tw}$":[71],"provided.":[73],"This":[74],"improves":[75],"over":[76],"natural":[78],"$\\mathrm{tw}^{O(\\mathrm{tw})}n^{O(1)}$":[79],"algorithm,":[81],"first":[85],"algorithm":[86,105],"kind":[89],"running":[91],"involving":[96],"strong":[97],"connectivity.":[98],"Second,":[99],"give":[101],"an":[102],"exact":[103],"exponential-time":[104],"solves":[107],"$2^n":[110],"time,":[112],"improving":[113],"known":[115],"bounds":[116],"general":[118],"graphs.":[120],"Finally,":[121],"investigate":[123],"kernelization":[124],"respect":[126],"to":[127],"vertex":[128,147],"cover.":[129],"We":[130],"prove":[131],"does":[134,167],"not":[135],"admit":[136,168],"polynomial":[138,151,170],"kernel":[139,171],"parameterized":[141],"by":[142],"size":[144],"cover,":[148],"unless":[149],"hierarchy":[152],"collapses.":[153],"contrast,":[155],"closely":[160],"related":[161],"Spanning":[164],"under":[172],"same":[174],"parameterization.":[175]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-30T00:00:00"}