{"id":"https://openalex.org/W7083192506","doi":"https://doi.org/10.1007/978-3-032-04700-7_3","title":"On the\u00a0Exact & Approximate Complexity of\u00a0the\u00a0Strongly Connected Steiner Subgraph Problem on Two Terminals with Demands","display_name":"On the\u00a0Exact & Approximate Complexity of\u00a0the\u00a0Strongly Connected Steiner Subgraph Problem on Two Terminals with Demands","publication_year":2025,"publication_date":"2025-09-11","ids":{"openalex":"https://openalex.org/W7083192506","doi":"https://doi.org/10.1007/978-3-032-04700-7_3"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-04700-7_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-04700-7_3","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.birmingham.ac.uk/en/publications/25c81d96-0455-44e8-ac8c-756f98e74746","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kevin Kurien Alex","orcid":"https://orcid.org/0009-0003-2179-9974"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Kevin Kurien Alex","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Birmingham, UK"],"raw_orcid":"https://orcid.org/0009-0003-2179-9974","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Rajesh Chitnis","orcid":"https://orcid.org/0000-0002-6098-7770"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rajesh Chitnis","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Birmingham, UK"],"raw_orcid":"https://orcid.org/0000-0002-6098-7770","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":null,"display_name":"Alex Tempest","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alex Tempest","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Birmingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.66982362,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"30","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10929","display_name":"Wnt/\u03b2-catenin signaling in development and cancer","score":0.9244999885559082,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10929","display_name":"Wnt/\u03b2-catenin signaling in development and cancer","score":0.9244999885559082,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10268","display_name":"Developmental Biology and Gene Regulation","score":0.031300000846385956,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12061","display_name":"Axon Guidance and Neuronal Signaling","score":0.013700000010430813,"subfield":{"id":"https://openalex.org/subfields/2804","display_name":"Cellular and Molecular Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7106000185012817},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6811000108718872},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4278999865055084},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.4023999869823456},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4007999897003174},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.39969998598098755},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3977999985218048},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3865000009536743},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.37709999084472656},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.37130001187324524}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7106000185012817},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6811000108718872},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6543999910354614},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5400000214576721},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5379999876022339},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42829999327659607},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4278999865055084},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.4023999869823456},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4007999897003174},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.39969998598098755},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3977999985218048},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3865000009536743},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.37709999084472656},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.37130001187324524},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.36899998784065247},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.358599990606308},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3434999883174896},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.32109999656677246},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C34628019","wikidata":"https://www.wikidata.org/wiki/Q13636890","display_name":"Algorithmics","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.2888000011444092},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.27230000495910645},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.2718000113964081},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.266400009393692},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.2556000053882599}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-032-04700-7_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-04700-7_3","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/25c81d96-0455-44e8-ac8c-756f98e74746","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/25c81d96-0455-44e8-ac8c-756f98e74746","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kurien Alex, K, Chitnis, R & Tempest, A 2025, On the Exact & Approximate Complexity of Strongly Connected Steiner Subgraph On Two Terminals With Demands. in A Je\u017c & J Otop (eds), Fundamentals of Computation Theory : 25th International Symposium, FCT 2025, Wroc\u0142aw, Poland, September 15\u201317, 2025, Proceedings. Lecture Notes in Computer Science, vol. 16106, Springer, pp. 30-44, 25th International Symposium on Fundamentals of Computation Theory, Wroc\u0142aw, Poland, 15/09/25. https://doi.org/10.1007/978-3-032-04700-7_3","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/25c81d96-0455-44e8-ac8c-756f98e74746","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/25c81d96-0455-44e8-ac8c-756f98e74746","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kurien Alex, K, Chitnis, R & Tempest, A 2025, On the Exact & Approximate Complexity of Strongly Connected Steiner Subgraph On Two Terminals With Demands. in A Je\u017c & J Otop (eds), Fundamentals of Computation Theory : 25th International Symposium, FCT 2025, Wroc\u0142aw, Poland, September 15\u201317, 2025, Proceedings. Lecture Notes in Computer Science, vol. 16106, Springer, pp. 30-44, 25th International Symposium on Fundamentals of Computation Theory, Wroc\u0142aw, Poland, 15/09/25. https://doi.org/10.1007/978-3-032-04700-7_3","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W95416648","https://openalex.org/W1523762238","https://openalex.org/W1552693528","https://openalex.org/W1555221261","https://openalex.org/W1760079236","https://openalex.org/W1791386552","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2009976792","https://openalex.org/W2142022975","https://openalex.org/W2143481766","https://openalex.org/W2147244785","https://openalex.org/W2154257711","https://openalex.org/W2158584754","https://openalex.org/W2172955861","https://openalex.org/W2228622483","https://openalex.org/W2295961103","https://openalex.org/W2401610261","https://openalex.org/W2472796018","https://openalex.org/W2944399784","https://openalex.org/W2951996037","https://openalex.org/W2962856411","https://openalex.org/W2963232826","https://openalex.org/W2995828778","https://openalex.org/W2997610302","https://openalex.org/W3106892521","https://openalex.org/W3122423875","https://openalex.org/W3155138594","https://openalex.org/W4241892047","https://openalex.org/W4292230561","https://openalex.org/W4404324153","https://openalex.org/W4406625022"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-12-28T23:10:05.387466","created_date":"2025-10-10T00:00:00"}