{"id":"https://openalex.org/W1977267311","doi":"https://doi.org/10.1145/1542362.1542399","title":"The Euclidean degree-4 minimum spanning tree problem is NP-hard","display_name":"The Euclidean degree-4 minimum spanning tree problem is NP-hard","publication_year":2009,"publication_date":"2009-06-08","ids":{"openalex":"https://openalex.org/W1977267311","doi":"https://doi.org/10.1145/1542362.1542399","mag":"1977267311"},"language":"en","primary_location":{"id":"doi:10.1145/1542362.1542399","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1542362.1542399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fifth annual symposium on Computational geometry","raw_type":"proceedings-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/A5072869145","display_name":"Andrea Francke","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Andrea Francke","raw_affiliation_strings":["ETH Z\u00fcrich, Z\u00fcrich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103088991","display_name":"Michael M. Hoffmann","orcid":"https://orcid.org/0000-0001-5307-7106"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Michael Hoffmann","raw_affiliation_strings":["ETH Z\u00fcrich, Z\u00fcrich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.1203,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.94852941,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"179","last_page":"188"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"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":0.9997000098228455,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937999844551086,"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/combinatorics","display_name":"Combinatorics","score":0.8130722045898438},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.8089523911476135},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7658299803733826},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7202495336532593},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6672213673591614},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6412512063980103},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6278135180473328},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6265627145767212},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6086435914039612},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.54804927110672},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5070416927337646},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4666008949279785},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.43336406350135803},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41806408762931824},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3785627484321594},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1750122606754303},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.15615209937095642},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1453486680984497},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1316005289554596},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07723581790924072},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.06450727581977844}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8130722045898438},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.8089523911476135},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7658299803733826},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7202495336532593},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6672213673591614},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6412512063980103},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6278135180473328},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6265627145767212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6086435914039612},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.54804927110672},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5070416927337646},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4666008949279785},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.43336406350135803},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41806408762931824},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3785627484321594},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1750122606754303},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.15615209937095642},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1453486680984497},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1316005289554596},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07723581790924072},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.06450727581977844},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1542362.1542399","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1542362.1542399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fifth annual symposium on Computational geometry","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1994248285","https://openalex.org/W2002985966","https://openalex.org/W2006382572","https://openalex.org/W2011039300","https://openalex.org/W2020112047","https://openalex.org/W2022563199","https://openalex.org/W2052218573","https://openalex.org/W2055569927","https://openalex.org/W2056839231","https://openalex.org/W2072970094","https://openalex.org/W2088839217","https://openalex.org/W2110367141","https://openalex.org/W2116680937","https://openalex.org/W2165142526","https://openalex.org/W2167579893","https://openalex.org/W2476096155","https://openalex.org/W2602800732","https://openalex.org/W3099328339"],"related_works":["https://openalex.org/W1985149601","https://openalex.org/W4308416203","https://openalex.org/W2943635264","https://openalex.org/W1964611452","https://openalex.org/W2059360098","https://openalex.org/W3099328339","https://openalex.org/W2058332489","https://openalex.org/W2518240130","https://openalex.org/W3016811403","https://openalex.org/W2162077219"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2],"it":[3],"is":[4],"an":[5],"NP-hard":[6],"problem":[7],"to":[8],"decide":[9],"for":[10],"a":[11,23,30],"given":[12,24],"set":[13],"P":[14,28],"of":[15,33,40],"n":[16],"points":[17],"in":[18],"the":[19],"Euclidean":[20],"plane":[21],"and":[22],"parameter":[25],"k\u2208R,":[26],"whether":[27],"admits":[29],"spanning":[31],"tree":[32],"maximum":[34],"vertex":[35],"degree":[36],"four":[37],"whose":[38],"sum":[39],"edge":[41],"lengths":[42],"does":[43],"not":[44],"exceed":[45],"k.":[46]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}