{"id":"https://openalex.org/W1520028909","doi":"https://doi.org/10.1007/3-540-44693-1_38","title":"Approximation Algorithms for Minimum Size 2-Connectivity Problems","display_name":"Approximation Algorithms for Minimum Size 2-Connectivity Problems","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1520028909","doi":"https://doi.org/10.1007/3-540-44693-1_38","mag":"1520028909"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44693-1_38","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44693-1_38","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":"conference-paper","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/A5079362010","display_name":"Piotr Krysta","orcid":"https://orcid.org/0000-0002-1498-9994"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Piotr Krysta","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, D-66123, Saarbr\u00fccken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, D-66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101673409","display_name":"Vijay Kumar","orcid":"https://orcid.org/0000-0002-2996-7181"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"V. S. Anil Kumar","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, D-66123, Saarbr\u00fccken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Stuhlsatzenhausweg 85, D-66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3383,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.62520525,"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":"431","last_page":"442"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.996999979019165,"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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.996999979019165,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9902999997138977,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7430633306503296},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7398641109466553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.68717360496521},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.6176748275756836},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5837559103965759},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5034872889518738},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.49784088134765625},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4839208722114563},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4783574938774109},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.47794440388679504},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4567578434944153},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4439815580844879},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.43988150358200073},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.28181809186935425},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21317872405052185},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1572645902633667}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7430633306503296},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7398641109466553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.68717360496521},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.6176748275756836},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5837559103965759},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5034872889518738},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.49784088134765625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4839208722114563},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4783574938774109},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.47794440388679504},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4567578434944153},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4439815580844879},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.43988150358200073},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28181809186935425},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21317872405052185},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1572645902633667},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-44693-1_38","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44693-1_38","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:edoc.mpg.de:518148","is_oa":false,"landing_page_url":"http://edoc.mpg.de/518148","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ferreira, Afonso; Reichel, Horst: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01), Springer, 431-442 (2001)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1330554","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-3170-0","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:1520028909","is_oa":false,"landing_page_url":"https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1330554","pdf_url":null,"source":{"id":"https://openalex.org/S4306533943","display_name":"Untitled Event","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Untitled Event","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1576926907","https://openalex.org/W1579870444","https://openalex.org/W1605196620","https://openalex.org/W1773631242","https://openalex.org/W1996575062","https://openalex.org/W2032378632","https://openalex.org/W2037686175","https://openalex.org/W2092113566","https://openalex.org/W2142607374","https://openalex.org/W2153014861","https://openalex.org/W2766198272","https://openalex.org/W6618503222","https://openalex.org/W6630131075"],"related_works":["https://openalex.org/W2092113566","https://openalex.org/W1773631242","https://openalex.org/W2055155874","https://openalex.org/W860361680","https://openalex.org/W2077642252","https://openalex.org/W2042660957","https://openalex.org/W28780775","https://openalex.org/W2552587983","https://openalex.org/W1573399792","https://openalex.org/W2739453629","https://openalex.org/W1660558358","https://openalex.org/W3184115741","https://openalex.org/W1549050991","https://openalex.org/W3147551976","https://openalex.org/W2789466034","https://openalex.org/W3085521625","https://openalex.org/W2029846150","https://openalex.org/W3104897947","https://openalex.org/W2129322254","https://openalex.org/W2113138058"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}