{"id":"https://openalex.org/W2228622483","doi":"https://doi.org/10.1007/s00453-016-0145-8","title":"A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands","display_name":"A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands","publication_year":2016,"publication_date":"2016-03-29","ids":{"openalex":"https://openalex.org/W2228622483","doi":"https://doi.org/10.1007/s00453-016-0145-8","mag":"2228622483"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-016-0145-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-016-0145-8","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.birmingham.ac.uk/en/publications/11e63ff3-1fa8-46fa-9ced-52cf5847001a","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012330722","display_name":"Rajesh Chitnis","orcid":"https://orcid.org/0000-0002-6098-7770"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Rajesh Chitnis","raw_affiliation_strings":["The Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"The Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047480720","display_name":"Hossein Esfandiari","orcid":"https://orcid.org/0000-0001-8130-6631"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hossein Esfandiari","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074837451","display_name":"Rohit Khandekar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rohit Khandekar","raw_affiliation_strings":["KCG Holdings Inc., Jersey City, NJ, USA"],"affiliations":[{"raw_affiliation_string":"KCG Holdings Inc., Jersey City, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056370891","display_name":"Guy Kortsarz","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy Kortsarz","raw_affiliation_strings":["Department of Computer Science, Rutgers University-Camden, Camden, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University-Camden, Camden, NJ, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087093711","display_name":"Saeed Seddighin","orcid":"https://orcid.org/0000-0002-3951-7096"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saeed Seddighin","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5012330722"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.7188,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73350343,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"77","issue":"4","first_page":"1216","last_page":"1239"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8169660568237305},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6251006722450256},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5268810391426086},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4733472168445587},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4726245403289795},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4491425156593323},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4158127009868622},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36828988790512085},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24731719493865967},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.19021597504615784},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12693431973457336}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8169660568237305},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6251006722450256},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5268810391426086},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4733472168445587},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4726245403289795},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4491425156593323},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4158127009868622},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36828988790512085},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24731719493865967},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.19021597504615784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12693431973457336},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-016-0145-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-016-0145-8","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/11e63ff3-1fa8-46fa-9ced-52cf5847001a","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/11e63ff3-1fa8-46fa-9ced-52cf5847001a","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":"Chitnis, R, Esfandiari, H, Hajiaghayi, M T, Khandekar, R, Kortsarz, G & Seddighin, S 2017, 'A tight algorithm for Strongly Connected Steiner Subgraph on two terminals with demands', Algorithmica, vol. 77, no. 4, pp. 1216-1239. https://doi.org/10.1007/s00453-016-0145-8","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/11e63ff3-1fa8-46fa-9ced-52cf5847001a","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84962257824&partnerID=8YFLogxK","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":"Chitnis , R , Esfandiari , H , Hajiaghayi , M T , Khandekar , R , Kortsarz , G & Seddighin , S 2017 , ' A tight algorithm for Strongly Connected Steiner Subgraph on two terminals with demands ' , Algorithmica , vol. 77 , no. 4 , pp. 1216-1239 . https://doi.org/10.1007/s00453-016-0145-8","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/11e63ff3-1fa8-46fa-9ced-52cf5847001a","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/11e63ff3-1fa8-46fa-9ced-52cf5847001a","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":"Chitnis, R, Esfandiari, H, Hajiaghayi, M T, Khandekar, R, Kortsarz, G & Seddighin, S 2017, 'A tight algorithm for Strongly Connected Steiner Subgraph on two terminals with demands', Algorithmica, vol. 77, no. 4, pp. 1216-1239. https://doi.org/10.1007/s00453-016-0145-8","raw_type":"article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3440488298","display_name":null,"funder_award_id":"1218620","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G373458095","display_name":null,"funder_award_id":"CCF-1161626","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7717912469","display_name":null,"funder_award_id":"CAREER 1053605","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7808751303","display_name":null,"funder_award_id":"FA9550-12-1-0423","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W95416648","https://openalex.org/W196127575","https://openalex.org/W1791386552","https://openalex.org/W1934698557","https://openalex.org/W1954883240","https://openalex.org/W1985572324","https://openalex.org/W1986144992","https://openalex.org/W1989224473","https://openalex.org/W1995725694","https://openalex.org/W1996668544","https://openalex.org/W2005771129","https://openalex.org/W2009976792","https://openalex.org/W2035613592","https://openalex.org/W2070024382","https://openalex.org/W2084876869","https://openalex.org/W2088820959","https://openalex.org/W2123790987","https://openalex.org/W2130190334","https://openalex.org/W2132087752","https://openalex.org/W2143481766","https://openalex.org/W2162561603","https://openalex.org/W2167815360","https://openalex.org/W2262920726","https://openalex.org/W2295961103","https://openalex.org/W2401939546","https://openalex.org/W2568450825","https://openalex.org/W2962884946","https://openalex.org/W2989902795"],"related_works":["https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W4205377127","https://openalex.org/W3016395638","https://openalex.org/W1636163329","https://openalex.org/W4292947165","https://openalex.org/W3045121788","https://openalex.org/W2765600275","https://openalex.org/W4300501056","https://openalex.org/W2392246501"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}