{"id":"https://openalex.org/W1995375333","doi":"https://doi.org/10.1145/1068009.1068139","title":"Minimum spanning trees made easier via multi-objective optimization","display_name":"Minimum spanning trees made easier via multi-objective optimization","publication_year":2005,"publication_date":"2005-06-25","ids":{"openalex":"https://openalex.org/W1995375333","doi":"https://doi.org/10.1145/1068009.1068139","mag":"1995375333"},"language":"en","primary_location":{"id":"doi:10.1145/1068009.1068139","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.17877/de290r-14132","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I4210166048","display_name":"Gesellschaft Fur Mathematik Und Datenverarbeitung","ror":"https://ror.org/02g6d4t03","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210166048"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Inst. f\u00fcr Informatik und Prakt. Mathematik, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Inst. f\u00fcr Informatik und Prakt. Mathematik, Kiel, Germany","institution_ids":["https://openalex.org/I4210166048"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075262791","display_name":"Ingo Wegener","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ingo Wegener","raw_affiliation_strings":["FB Informatik, Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"FB Informatik, Dortmund, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089531887"],"corresponding_institution_ids":["https://openalex.org/I4210166048"],"apc_list":null,"apc_paid":null,"fwci":3.0299,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.9124424,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"763","last_page":"769"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6810623407363892},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.6579463481903076},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5713446140289307},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5449998378753662},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5413920283317566},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5074266791343689},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.5074214339256287},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4773595333099365},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4534691274166107},{"id":"https://openalex.org/keywords/l-reduction","display_name":"L-reduction","score":0.4405193328857422},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.361179918050766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2790621519088745},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.23600929975509644},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.16092270612716675}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6810623407363892},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6579463481903076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5713446140289307},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5449998378753662},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5413920283317566},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5074266791343689},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.5074214339256287},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4773595333099365},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4534691274166107},{"id":"https://openalex.org/C62114133","wikidata":"https://www.wikidata.org/wiki/Q5366944","display_name":"L-reduction","level":5,"score":0.4405193328857422},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.361179918050766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2790621519088745},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.23600929975509644},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.16092270612716675}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1068009.1068139","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1068009.1068139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.420.7188","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.420.7188","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005/docs/p763.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.71.7158","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.7158","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sfbci.uni-dortmund.de/Publications/Reference/Downloads/19205.pdf","raw_type":"text"},{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/22119","is_oa":false,"landing_page_url":"http://hdl.handle.net/2003/22119","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:Text"},{"id":"doi:10.17877/de290r-14132","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-14132","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"report"}],"best_oa_location":{"id":"doi:10.17877/de290r-14132","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-14132","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"report"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1522890465","https://openalex.org/W1552383524","https://openalex.org/W1553373771","https://openalex.org/W1554385073","https://openalex.org/W1573730023","https://openalex.org/W1595498733","https://openalex.org/W1636202028","https://openalex.org/W1637451315","https://openalex.org/W1963770385","https://openalex.org/W2008581797","https://openalex.org/W2034762222","https://openalex.org/W2077823485","https://openalex.org/W2098907614","https://openalex.org/W2142146559","https://openalex.org/W2165220807","https://openalex.org/W2585305412","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4241708030","https://openalex.org/W4285719527","https://openalex.org/W4292408320","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W4297582752","https://openalex.org/W4285805405","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W85101999","https://openalex.org/W2145877535","https://openalex.org/W2744730182","https://openalex.org/W3134440233","https://openalex.org/W2751605210","https://openalex.org/W2068949283"],"abstract_inverted_index":{"Many":[0],"real-world":[1],"problems":[2,6,29],"are":[3,10,30],"multi-objective":[4,27,82],"optimization":[5,28],"and":[7],"evolutionary":[8,64],"algorithms":[9],"quite":[11],"successful":[12],"on":[13],"such":[14],"problems.":[15,37],"Since":[16],"the":[17,24,43,61,85,91,97],"task":[18],"is":[19,68,89,93],"to":[20,48],"compute":[21],"or":[22],"approximate":[23],"Pareto":[25],"front,":[26],"considered":[31],"as":[32],"more":[33,49,54,77],"difficult":[34],"than":[35,50],"single-objective":[36,72],"One":[38],"should":[39],"not":[40],"forget":[41],"that":[42,56,70],"fitness":[44],"vector":[45],"with":[46],"respect":[47],"one":[51],"objective":[52],"contains":[53],"information":[55],"in":[57],"principle":[58],"can":[59,74],"direct":[60],"search":[62],"of":[63,84,99],"algorithms.":[65],"Therefore,":[66],"it":[67],"possible":[69],"a":[71,80],"problem":[73],"be":[75],"solved":[76],"efficiently":[78],"via":[79],"generalized":[81],"model":[83],"problem.":[86],"That":[87],"this":[88],"indeed":[90],"case":[92],"proved":[94],"by":[95],"investigating":[96],"computation":[98],"minimum":[100],"spanning":[101],"trees.":[102]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}