{"id":"https://openalex.org/W4247251578","doi":"https://doi.org/10.1007/978-3-642-23719-5_2","title":"Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph","display_name":"Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W4247251578","doi":"https://doi.org/10.1007/978-3-642-23719-5_2"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-23719-5_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-23719-5_2","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/A5024478433","display_name":"Loukas Georgiadis","orcid":"https://orcid.org/0000-0002-9706-7409"},"institutions":[{"id":"https://openalex.org/I89506807","display_name":"University of Western Macedonia","ror":"https://ror.org/00a5pe906","country_code":"GR","type":"education","lineage":["https://openalex.org/I89506807"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Loukas Georgiadis","raw_affiliation_strings":["Department of Informatics and Telecommunications Engineering, University of Western Macedonia, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Informatics and Telecommunications Engineering, University of Western Macedonia, Greece","institution_ids":["https://openalex.org/I89506807"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024478433"],"corresponding_institution_ids":["https://openalex.org/I89506807"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.5565,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84019608,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"13","last_page":"24"},"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.9994999766349792,"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.9994999766349792,"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/T11106","display_name":"Data Management and Algorithms","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.7558941841125488},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6885804533958435},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6618757247924805},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6496410965919495},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5932836532592773},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5836731791496277},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5526092648506165},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5386848449707031},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48707321286201477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4609345495700836},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45125943422317505},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.42806458473205566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40955814719200134},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3700297474861145},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35798126459121704},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1591615080833435}],"concepts":[{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.7558941841125488},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6885804533958435},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6618757247924805},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6496410965919495},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5932836532592773},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5836731791496277},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5526092648506165},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5386848449707031},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48707321286201477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4609345495700836},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45125943422317505},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.42806458473205566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40955814719200134},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3700297474861145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35798126459121704},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1591615080833435}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-23719-5_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-23719-5_2","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1545325081","https://openalex.org/W1951501494","https://openalex.org/W1977545325","https://openalex.org/W1985245264","https://openalex.org/W2011039300","https://openalex.org/W2014665344","https://openalex.org/W2018804864","https://openalex.org/W2052184941","https://openalex.org/W2090359754","https://openalex.org/W2091299439","https://openalex.org/W2111117034","https://openalex.org/W2111379929","https://openalex.org/W2134875769","https://openalex.org/W2153374077","https://openalex.org/W2157529519","https://openalex.org/W2977555790"],"related_works":["https://openalex.org/W2057903654","https://openalex.org/W2033567934","https://openalex.org/W2782194400","https://openalex.org/W2365236566","https://openalex.org/W4206573252","https://openalex.org/W2023776467","https://openalex.org/W2230758337","https://openalex.org/W2011214451","https://openalex.org/W2587669528","https://openalex.org/W2052184941"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}