{"id":"https://openalex.org/W2155882050","doi":"https://doi.org/10.1145/1569901.1569939","title":"Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances","display_name":"Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W2155882050","doi":"https://doi.org/10.1145/1569901.1569939","mag":"2155882050"},"language":"en","primary_location":{"id":"doi:10.1145/1569901.1569939","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1569939","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","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/A5009504242","display_name":"Martin Gr\u016fber","orcid":"https://orcid.org/0000-0001-5014-457X"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Martin Gruber","raw_affiliation_strings":["Vienna University of Technology, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030647388","display_name":"G\u00fcnther R. Raidl","orcid":"https://orcid.org/0000-0002-3293-177X"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"G\u00fcnther R. Raidl","raw_affiliation_strings":["Vienna University of Technology, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009504242"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.9144,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.78619366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"263","last_page":"270"},"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.994700014591217,"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.994700014591217,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9934999942779541,"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.9932000041007996,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6896188259124756},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.643170177936554},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6198185086250305},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5858286023139954},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5590067505836487},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.5477315187454224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5408468842506409},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5157792568206787},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4914911985397339},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4653208255767822},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.41861939430236816},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.3526240289211273},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25654542446136475},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05170735716819763}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6896188259124756},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.643170177936554},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6198185086250305},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5858286023139954},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5590067505836487},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.5477315187454224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5408468842506409},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5157792568206787},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4914911985397339},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4653208255767822},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.41861939430236816},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.3526240289211273},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25654542446136475},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05170735716819763},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1569901.1569939","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1569901.1569939","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.218.450","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.450","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ads.tuwien.ac.at/publications/bib/pdf/gruber-09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W336448565","https://openalex.org/W1498712363","https://openalex.org/W1568706064","https://openalex.org/W1983511657","https://openalex.org/W1992419399","https://openalex.org/W2011039300","https://openalex.org/W2011065039","https://openalex.org/W2017927472","https://openalex.org/W2024315858","https://openalex.org/W2059690430","https://openalex.org/W2078614936","https://openalex.org/W2079911323","https://openalex.org/W2090275183","https://openalex.org/W2094076493","https://openalex.org/W2104254980","https://openalex.org/W2115831664","https://openalex.org/W2140606557","https://openalex.org/W2166775052","https://openalex.org/W2341171179","https://openalex.org/W2997776631"],"related_works":["https://openalex.org/W3099328339","https://openalex.org/W98489388","https://openalex.org/W2071374370","https://openalex.org/W1601733264","https://openalex.org/W2011697681","https://openalex.org/W4282048906","https://openalex.org/W2101775461","https://openalex.org/W2116207970","https://openalex.org/W2093241092","https://openalex.org/W2000579002"],"abstract_inverted_index":{"The":[0],"bounded":[1],"diameter":[2,74,115],"minimum":[3,45],"spanning":[4,46],"tree":[5,47,76],"problem":[6,12],"is":[7,23,77],"an":[8],"NP-hard":[9],"combinatorial":[10],"optimization":[11],"arising,":[13],"for":[14,104],"example,":[15],"in":[16,55],"network":[17],"design":[18],"when":[19],"quality":[20,126],"of":[21,24,72,95,132,143],"service":[22],"concern.":[25],"There":[26],"exist":[27],"various":[28],"exact":[29],"and":[30,49,147],"metaheuristic":[31],"approaches":[32],"addressing":[33],"this":[34,105,122],"problem,":[35],"whereas":[36,136],"fast":[37],"construction":[38,70],"heuristics":[39],"are":[40,81,119],"primarily":[41],"based":[42,63],"on":[43,57,64,92,108],"Prim\u2019s":[44],"algorithm":[48],"fail":[50],"to":[51,67],"produce":[52],"reasonable":[53],"solutions":[54],"particular":[56],"large":[58,109],"Euclidean":[59,110],"instances.":[60],"A":[61],"method":[62],"hierarchical":[65],"clustering":[66,96],"guide":[68],"the":[69,93,117,124,137,144],"process":[71],"a":[73,85,100,113,133,141],"constrained":[75],"presented.":[78],"Solutions":[79],"obtained":[80],"further":[82],"refined":[83],"using":[84],"greedy":[86],"randomized":[87],"adaptive":[88],"search":[89,103],"procedure.":[90],"Based":[91],"idea":[94],"we":[97],"also":[98,128],"designed":[99],"new":[101],"neighborhood":[102],"problem.":[106],"Especially":[107],"instances":[111],"with":[112,130],"tight":[114],"bound":[116],"results":[118],"excellent.":[120],"In":[121],"case":[123],"solution":[125],"can":[127],"compete":[129],"that":[131],"leading":[134],"metaheuristic,":[135],"computation":[138],"only":[139],"needs":[140],"fraction":[142],"time.":[145],"Categories":[146],"Subject":[148],"Descriptors":[149]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}