{"id":"https://openalex.org/W196127575","doi":"https://doi.org/10.1007/978-3-319-13524-3_14","title":"A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)","display_name":"A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W196127575","doi":"https://doi.org/10.1007/978-3-319-13524-3_14","mag":"196127575"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-13524-3_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-13524-3_14","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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/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":true,"raw_author_name":"Rajesh Hemant Chitnis","raw_affiliation_strings":["Department of Computer Science, University of Maryland at College Park, College Park, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland at College Park, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"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 at College Park, College Park, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland at College Park, College Park, 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 at College Park, College Park, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland at College Park, College Park, 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., New York, USA"],"affiliations":[{"raw_affiliation_string":"KCG Holdings Inc., New York, 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, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University-Camden, Camden, 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 at College Park, College Park, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland at College Park, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5012330722"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2013,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77675166,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"159","last_page":"171"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/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.9965999722480774,"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.8111270070075989},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5589287281036377},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5064538717269897},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48639729619026184},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4770585596561432},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3700326085090637},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.27914711833000183},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22186115384101868}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8111270070075989},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5589287281036377},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5064538717269897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48639729619026184},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4770585596561432},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3700326085090637},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.27914711833000183},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22186115384101868},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-13524-3_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-13524-3_14","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/cd40c208-f661-48b5-aa31-81fb247018d8","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/cd40c208-f661-48b5-aa31-81fb247018d8","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chitnis, R H, Esfandiari, H, Hajiaghayi, M T, Khandekar, R, Kortsarz, G & Seddighin, S 2014, A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract). in M Cygan & P Heggernes (eds), Parameterized and Exact Computation : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers. Lecture Notes in Computer Science , vol. 8894, Springer Verlag, pp. 159-171, 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, Wroclaw, Poland, 10/09/14. https://doi.org/10.1007/978-3-319-13524-3_14","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/cd40c208-f661-48b5-aa31-81fb247018d8","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/a-tight-algorithm-for-strongly-connected-steiner-subgraph-on-two-terminals-with-demands-extended-abstract(cd40c208-f661-48b5-aa31-81fb247018d8).html","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chitnis , R H , Esfandiari , H , Hajiaghayi , M T , Khandekar , R , Kortsarz , G & Seddighin , S 2014 , A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) . in M Cygan & P Heggernes (eds) , Parameterized and Exact Computation : 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers . Lecture Notes in Computer Science , vol. 8894 , Springer Verlag , pp. 159-171 , 9th International Symposium on Parameterized and Exact Computation, IPEC 2014 , Wroclaw , Poland , 10/09/14 . https://doi.org/10.1007/978-3-319-13524-3_14","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W95416648","https://openalex.org/W1589421353","https://openalex.org/W1954883240","https://openalex.org/W1989224473","https://openalex.org/W2009976792","https://openalex.org/W2070024382","https://openalex.org/W2084876869","https://openalex.org/W2123790987","https://openalex.org/W2130190334","https://openalex.org/W2143481766","https://openalex.org/W2167815360","https://openalex.org/W2262920726","https://openalex.org/W2295961103","https://openalex.org/W2401939546","https://openalex.org/W2489961716","https://openalex.org/W2568450825","https://openalex.org/W2962884946","https://openalex.org/W2989902795","https://openalex.org/W4253565129"],"related_works":["https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W3016395638","https://openalex.org/W1636163329","https://openalex.org/W4292947165","https://openalex.org/W3045121788","https://openalex.org/W3201655533","https://openalex.org/W3134442314","https://openalex.org/W2281248943","https://openalex.org/W3102538728"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}