{"id":"https://openalex.org/W2073262840","doi":"https://doi.org/10.1007/bf02086608","title":"The realization problem for Euclidean minimum spanning trees is NP-hard","display_name":"The realization problem for Euclidean minimum spanning trees is NP-hard","publication_year":1996,"publication_date":"1996-07-01","ids":{"openalex":"https://openalex.org/W2073262840","doi":"https://doi.org/10.1007/bf02086608","mag":"2073262840"},"language":"en","primary_location":{"id":"doi:10.1007/bf02086608","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02086608","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/A5014630148","display_name":"P. Eades","orcid":"https://orcid.org/0000-0002-7369-1397"},"institutions":[{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"P. Eades","raw_affiliation_strings":["Department of Computer Science, University of Newcastle, 2308, Newcastle, NSW, Australia","Department of Computer Science, University of Newcastle, Newcastle, Australia#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Newcastle, 2308, Newcastle, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]},{"raw_affiliation_string":"Department of Computer Science, University of Newcastle, Newcastle, Australia#TAB#","institution_ids":["https://openalex.org/I78757542"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036116001","display_name":"Sue Whitesides","orcid":null},"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":false,"raw_author_name":"S. Whitesides","raw_affiliation_strings":["School of Computer Science, McGill University, H3A 2A7, Montreal, Quebec, Canada","School of Computer Science, McGill University Montreal, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, McGill University, H3A 2A7, Montreal, Quebec, Canada","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"School of Computer Science, McGill University Montreal, Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014630148"],"corresponding_institution_ids":["https://openalex.org/I78757542"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.7347,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.8952426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"16","issue":"1","first_page":"60","last_page":"82"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9993000030517578,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9962000250816345,"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/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.695778489112854},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.6536413431167603},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.616611897945404},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5956820249557495},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5144224762916565},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4990658760070801},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4835502803325653},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.4554232954978943},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4505760967731476},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4437258839607239},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34315943717956543},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23156487941741943}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.695778489112854},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.6536413431167603},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.616611897945404},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5956820249557495},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5144224762916565},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4990658760070801},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4835502803325653},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.4554232954978943},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4505760967731476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4437258839607239},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34315943717956543},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23156487941741943},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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":1,"locations":[{"id":"doi:10.1007/bf02086608","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02086608","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W57104340","https://openalex.org/W278703347","https://openalex.org/W1847702720","https://openalex.org/W1967603300","https://openalex.org/W1971486096","https://openalex.org/W1981227591","https://openalex.org/W1982599920","https://openalex.org/W1986893644","https://openalex.org/W1989650529","https://openalex.org/W2007280161","https://openalex.org/W2011039300","https://openalex.org/W2045012623","https://openalex.org/W2050602252","https://openalex.org/W2052943053","https://openalex.org/W2059799954","https://openalex.org/W2066364954","https://openalex.org/W2077005280","https://openalex.org/W2117771589","https://openalex.org/W2145021486","https://openalex.org/W2145289828","https://openalex.org/W2149977307","https://openalex.org/W2163457929","https://openalex.org/W4285719527","https://openalex.org/W6663111377","https://openalex.org/W6683979568"],"related_works":["https://openalex.org/W3099328339","https://openalex.org/W98489388","https://openalex.org/W3187208706","https://openalex.org/W1985149601","https://openalex.org/W3001850742","https://openalex.org/W1561849181","https://openalex.org/W1587959445","https://openalex.org/W1964611452","https://openalex.org/W2082872574","https://openalex.org/W2071374370"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}