{"id":"https://openalex.org/W3014401826","doi":"https://doi.org/10.1007/s42979-020-0120-y","title":"Novel Heuristics for the Euclidean Leaf-Constrained Minimum Spanning Tree Problem","display_name":"Novel Heuristics for the Euclidean Leaf-Constrained Minimum Spanning Tree Problem","publication_year":2020,"publication_date":"2020-03-01","ids":{"openalex":"https://openalex.org/W3014401826","doi":"https://doi.org/10.1007/s42979-020-0120-y","mag":"3014401826"},"language":"en","primary_location":{"id":"doi:10.1007/s42979-020-0120-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s42979-020-0120-y","pdf_url":null,"source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","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/A5113894866","display_name":"V. Prem Prakash","orcid":null},"institutions":[{"id":"https://openalex.org/I178254495","display_name":"Dayalbagh Educational Institute","ror":"https://ror.org/04q4j2f69","country_code":"IN","type":"education","lineage":["https://openalex.org/I178254495"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"V. Prem Prakash","raw_affiliation_strings":["Department of Electrical Engineering, Faculty of Engineering, Dayalbagh Educational Institute (Deemed University), Agra, 282005, India","Department of Electrical Engineering, Faculty of Engineering, Dayalbagh Educational Institute (Deemed University), Agra, India"],"raw_orcid":"https://orcid.org/0000-0002-9573-6541","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Faculty of Engineering, Dayalbagh Educational Institute (Deemed University), Agra, 282005, India","institution_ids":["https://openalex.org/I178254495"]},{"raw_affiliation_string":"Department of Electrical Engineering, Faculty of Engineering, Dayalbagh Educational Institute (Deemed University), Agra, India","institution_ids":["https://openalex.org/I178254495"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072764860","display_name":"C. Patvardhan","orcid":null},"institutions":[{"id":"https://openalex.org/I178254495","display_name":"Dayalbagh Educational Institute","ror":"https://ror.org/04q4j2f69","country_code":"IN","type":"education","lineage":["https://openalex.org/I178254495"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C. Patvardhan","raw_affiliation_strings":["Department of Electrical Engineering, Faculty of Engineering, Dayalbagh Educational Institute (Deemed University), Agra, 282005, India","Department of Electrical Engineering, Faculty of Engineering, Dayalbagh Educational Institute (Deemed University), Agra, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Faculty of Engineering, Dayalbagh Educational Institute (Deemed University), Agra, 282005, India","institution_ids":["https://openalex.org/I178254495"]},{"raw_affiliation_string":"Department of Electrical Engineering, Faculty of Engineering, Dayalbagh Educational Institute (Deemed University), Agra, India","institution_ids":["https://openalex.org/I178254495"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113894866"],"corresponding_institution_ids":["https://openalex.org/I178254495"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.1808,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.56857721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"1","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8700273036956787},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7260994911193848},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.705500602722168},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5283922553062439},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5189899802207947},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5065003633499146},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4919752776622772},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.48281916975975037},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.47611838579177856},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4666424095630646},{"id":"https://openalex.org/keywords/extant-taxon","display_name":"Extant taxon","score":0.4604623317718506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4208822250366211},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41116422414779663},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32965701818466187},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.30401891469955444}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8700273036956787},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7260994911193848},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.705500602722168},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5283922553062439},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5189899802207947},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5065003633499146},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4919752776622772},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.48281916975975037},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.47611838579177856},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4666424095630646},{"id":"https://openalex.org/C178300618","wikidata":"https://www.wikidata.org/wiki/Q1898509","display_name":"Extant taxon","level":2,"score":0.4604623317718506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4208822250366211},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41116422414779663},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32965701818466187},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.30401891469955444},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s42979-020-0120-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s42979-020-0120-y","pdf_url":null,"source":{"id":"https://openalex.org/S4210174798","display_name":"SN Computer Science","issn_l":"2661-8907","issn":["2661-8907","2662-995X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SN Computer Science","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":20,"referenced_works":["https://openalex.org/W46524831","https://openalex.org/W1965680834","https://openalex.org/W1983511657","https://openalex.org/W2006938809","https://openalex.org/W2017927472","https://openalex.org/W2020381385","https://openalex.org/W2027592267","https://openalex.org/W2035683593","https://openalex.org/W2041944088","https://openalex.org/W2055424670","https://openalex.org/W2088797223","https://openalex.org/W2095246902","https://openalex.org/W2103657951","https://openalex.org/W2126397829","https://openalex.org/W2127218421","https://openalex.org/W2147411825","https://openalex.org/W2166775052","https://openalex.org/W2176143254","https://openalex.org/W2805528529","https://openalex.org/W2976170045"],"related_works":["https://openalex.org/W98489388","https://openalex.org/W3187208706","https://openalex.org/W1985149601","https://openalex.org/W3001850742","https://openalex.org/W1561849181","https://openalex.org/W1964611452","https://openalex.org/W4308416203","https://openalex.org/W3099328339","https://openalex.org/W3081212354","https://openalex.org/W4295683043"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}