{"id":"https://openalex.org/W2013576079","doi":"https://doi.org/10.1016/s0020-0190(98)00010-6","title":"A 2.5-factor approximation algorithm for the k-MST problem","display_name":"A 2.5-factor approximation algorithm for the k-MST problem","publication_year":1998,"publication_date":"1998-02-01","ids":{"openalex":"https://openalex.org/W2013576079","doi":"https://doi.org/10.1016/s0020-0190(98)00010-6","mag":"2013576079"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(98)00010-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(98)00010-6","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5022760571","display_name":"Sunil Arya","orcid":null},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Sunil Arya","raw_affiliation_strings":["Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong","Hong Kong Univ of Sci & Tech, Clear Water Bay, Kowloon, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I200769079"]},{"raw_affiliation_string":"Hong Kong Univ of Sci & Tech, Clear Water Bay, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113688016","display_name":"H. Ramesh","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"H. Ramesh","raw_affiliation_strings":["Indian Institute of Science, Bangalore, India","Indian Inst. of Science, Bangalore  India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science, Bangalore, India","institution_ids":["https://openalex.org/I59270414"]},{"raw_affiliation_string":"Indian Inst. of Science, Bangalore  India","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022760571"],"corresponding_institution_ids":["https://openalex.org/I200769079"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":3.0606,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.91156283,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"65","issue":"3","first_page":"117","last_page":"118"},"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.9993000030517578,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/mathematics","display_name":"Mathematics","score":0.7091855406761169},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7061492800712585},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.637116551399231},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5650317668914795},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5351584553718567},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.457765132188797},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.44541245698928833},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40644940733909607},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37046223878860474},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3401558995246887}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7091855406761169},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7061492800712585},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.637116551399231},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5650317668914795},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5351584553718567},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.457765132188797},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.44541245698928833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40644940733909607},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37046223878860474},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3401558995246887},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0020-0190(98)00010-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(98)00010-6","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-27920","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-27920","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1575625195","https://openalex.org/W2001139415","https://openalex.org/W2112638680","https://openalex.org/W6922255115"],"related_works":["https://openalex.org/W1719252778","https://openalex.org/W922283457","https://openalex.org/W2031098440","https://openalex.org/W4307385446","https://openalex.org/W2466894780","https://openalex.org/W3092119098","https://openalex.org/W2003008160","https://openalex.org/W2381713449","https://openalex.org/W2731724293","https://openalex.org/W2904724461"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}