{"id":"https://openalex.org/W3033508120","doi":"https://doi.org/10.1142/s1793830920500676","title":"On the longest spanning tree with neighborhoods","display_name":"On the longest spanning tree with neighborhoods","publication_year":2020,"publication_date":"2020-06-04","ids":{"openalex":"https://openalex.org/W3033508120","doi":"https://doi.org/10.1142/s1793830920500676","mag":"3033508120"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830920500676","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830920500676","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5100451971","display_name":"Ke Chen","orcid":"https://orcid.org/0000-0001-5470-6621"},"institutions":[{"id":"https://openalex.org/I43579087","display_name":"University of Wisconsin\u2013Milwaukee","ror":"https://ror.org/031q21x57","country_code":"US","type":"education","lineage":["https://openalex.org/I43579087"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ke Chen","raw_affiliation_strings":["Department of Computer Science, University of Wisconsin\u2013Milwaukee, Milwaukee, Wisconsin, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wisconsin\u2013Milwaukee, Milwaukee, Wisconsin, USA","institution_ids":["https://openalex.org/I43579087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091313409","display_name":"Adrian Dumitrescu","orcid":"https://orcid.org/0000-0002-1118-0321"},"institutions":[{"id":"https://openalex.org/I43579087","display_name":"University of Wisconsin\u2013Milwaukee","ror":"https://ror.org/031q21x57","country_code":"US","type":"education","lineage":["https://openalex.org/I43579087"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adrian Dumitrescu","raw_affiliation_strings":["Department of Computer Science, University of Wisconsin\u2013Milwaukee, Milwaukee, Wisconsin, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wisconsin\u2013Milwaukee, Milwaukee, Wisconsin, USA","institution_ids":["https://openalex.org/I43579087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100451971"],"corresponding_institution_ids":["https://openalex.org/I43579087"],"apc_list":null,"apc_paid":null,"fwci":0.6245,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.74820496,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"05","first_page":"2050067","last_page":"2050067"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"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.996999979019165,"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/spanning-tree","display_name":"Spanning tree","score":0.7805615663528442},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7106379270553589},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6599752902984619},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6358292102813721},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5202042460441589},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5087605118751526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4808509945869446},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4737694561481476},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4513205885887146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37293821573257446},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3446962833404541},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1784999668598175},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09199413657188416}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7805615663528442},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7106379270553589},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6599752902984619},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6358292102813721},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5202042460441589},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5087605118751526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4808509945869446},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4737694561481476},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4513205885887146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37293821573257446},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3446962833404541},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1784999668598175},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09199413657188416},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830920500676","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830920500676","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7799999713897705,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1552092932","https://openalex.org/W1555471913","https://openalex.org/W1559701472","https://openalex.org/W1656332081","https://openalex.org/W1968215127","https://openalex.org/W1981568663","https://openalex.org/W2036493899","https://openalex.org/W2038347888","https://openalex.org/W2074455653","https://openalex.org/W2074815218","https://openalex.org/W2085110997","https://openalex.org/W2109075893","https://openalex.org/W2110824994","https://openalex.org/W2158944832","https://openalex.org/W2481227236","https://openalex.org/W2911302472","https://openalex.org/W4241946002"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"We":[0],"study":[1],"a":[2,10,23],"maximization":[3],"problem":[4,69],"for":[5],"geometric":[6],"network":[7],"design.":[8],"Given":[9],"set":[11],"of":[12],"[Formula:":[13,19,50,61],"see":[14,20,51,62],"text]":[15],"compact":[16],"neighborhoods":[17],"in":[18,25,73],"text],":[21,52],"select":[22],"point":[24],"each":[26],"neighborhood,":[27],"so":[28],"that":[29,67],"the":[30,55,68,74],"longest":[31],"spanning":[32],"tree":[33],"on":[34],"these":[35],"points":[36],"(as":[37],"vertices)":[38],"has":[39],"maximum":[40],"length.":[41],"Here,":[42],"we":[43,65],"give":[44],"an":[45],"approximation":[46],"algorithm":[47],"with":[48],"ratio":[49],"which":[53],"represents":[54],"first,":[56],"albeit":[57],"small,":[58],"improvement":[59],"beyond":[60],"text].":[63],"While":[64],"suspect":[66],"is":[70],"NP-hard":[71],"already":[72],"plane,":[75],"this":[76],"issue":[77],"remains":[78],"open.":[79]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}