{"id":"https://openalex.org/W2163546498","doi":"https://doi.org/10.1007/s00453-014-9869-5","title":"An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem","display_name":"An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem","publication_year":2014,"publication_date":"2014-01-13","ids":{"openalex":"https://openalex.org/W2163546498","doi":"https://doi.org/10.1007/s00453-014-9869-5","mag":"2163546498"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-014-9869-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-014-9869-5","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005632876","display_name":"Bundit Laekhanukit","orcid":"https://orcid.org/0000-0002-4476-8914"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Bundit Laekhanukit","raw_affiliation_strings":["McGill University, 3480 University Street, Montreal, H3A 0E9, Canada"],"affiliations":[{"raw_affiliation_string":"McGill University, 3480 University Street, Montreal, H3A 0E9, Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005632876"],"corresponding_institution_ids":["https://openalex.org/I5023651"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.8279,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.86276065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"72","issue":"3","first_page":"714","last_page":"733"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"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/T12288","display_name":"Optimization and Search Problems","score":0.9937999844551086,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.773827850818634},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6671336889266968},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6635901927947998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6029395461082458},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5829005837440491},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5270103216171265},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5176525712013245},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.49434828758239746},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43257221579551697},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4004514515399933},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37207353115081787}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.773827850818634},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6671336889266968},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6635901927947998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6029395461082458},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5829005837440491},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5270103216171265},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5176525712013245},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.49434828758239746},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43257221579551697},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4004514515399933},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37207353115081787}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-014-9869-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-014-9869-5","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1531368347","https://openalex.org/W1582339485","https://openalex.org/W1582840176","https://openalex.org/W1967595345","https://openalex.org/W1968690018","https://openalex.org/W1975776599","https://openalex.org/W1976584101","https://openalex.org/W1984289304","https://openalex.org/W1986011879","https://openalex.org/W1987353362","https://openalex.org/W1989224473","https://openalex.org/W1990981902","https://openalex.org/W2033691165","https://openalex.org/W2052656799","https://openalex.org/W2052687843","https://openalex.org/W2056152695","https://openalex.org/W2058521212","https://openalex.org/W2078501279","https://openalex.org/W2079430060","https://openalex.org/W2121085314","https://openalex.org/W2138536745","https://openalex.org/W2141156487","https://openalex.org/W2153264420","https://openalex.org/W2157247984","https://openalex.org/W2167621755","https://openalex.org/W2172955861","https://openalex.org/W2766198272","https://openalex.org/W2963693432","https://openalex.org/W4245266864"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W2404561224"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}