{"id":"https://openalex.org/W4400412365","doi":"https://doi.org/10.1145/3638529.3654165","title":"Generalised Kruskal Mutation for the Multi-Objective Minimum Spanning Tree Problem","display_name":"Generalised Kruskal Mutation for the Multi-Objective Minimum Spanning Tree Problem","publication_year":2024,"publication_date":"2024-07-08","ids":{"openalex":"https://openalex.org/W4400412365","doi":"https://doi.org/10.1145/3638529.3654165"},"language":"en","primary_location":{"id":"doi:10.1145/3638529.3654165","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3638529.3654165","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","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/A5083504710","display_name":"Jakob Bossek","orcid":"https://orcid.org/0000-0002-4121-4668"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jakob Bossek","raw_affiliation_strings":["Department of Computer Science, University of Paderborn, Paderborn, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4121-4668","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Paderborn, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003026076","display_name":"Christian Grimme","orcid":"https://orcid.org/0000-0002-8608-8773"},"institutions":[{"id":"https://openalex.org/I22465464","display_name":"University of M\u00fcnster","ror":"https://ror.org/00pd74e08","country_code":"DE","type":"education","lineage":["https://openalex.org/I22465464"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Grimme","raw_affiliation_strings":["Department of Information Systems, University of M\u00fcnster, M\u00fcnster, Germany"],"raw_orcid":"https://orcid.org/0000-0002-8608-8773","affiliations":[{"raw_affiliation_string":"Department of Information Systems, University of M\u00fcnster, M\u00fcnster, Germany","institution_ids":["https://openalex.org/I22465464"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3517,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51630435,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"141"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9987999796867371,"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":0.9987999796867371,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9980999827384949,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9919999837875366,"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/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.8727635145187378},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.737106204032898},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6183792352676392},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5600350499153137},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5047005414962769},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.4646199941635132},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4239307641983032},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3458104133605957},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.336697518825531},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31342244148254395},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28694212436676025},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26616764068603516},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.08986490964889526},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.08374345302581787}],"concepts":[{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.8727635145187378},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.737106204032898},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6183792352676392},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5600350499153137},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5047005414962769},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.4646199941635132},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4239307641983032},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3458104133605957},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.336697518825531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31342244148254395},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28694212436676025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26616764068603516},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.08986490964889526},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.08374345302581787},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3638529.3654165","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3638529.3654165","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","display_name":"Climate action","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1483353037","https://openalex.org/W1553373771","https://openalex.org/W1808460590","https://openalex.org/W1965680834","https://openalex.org/W1967957610","https://openalex.org/W1988114663","https://openalex.org/W2017927472","https://openalex.org/W2023658462","https://openalex.org/W2047517090","https://openalex.org/W2067273697","https://openalex.org/W2077823485","https://openalex.org/W2091360576","https://openalex.org/W2109343068","https://openalex.org/W2111933629","https://openalex.org/W2116661285","https://openalex.org/W2120016402","https://openalex.org/W2126105956","https://openalex.org/W2140037265","https://openalex.org/W2162974503","https://openalex.org/W2776773535","https://openalex.org/W2807218612","https://openalex.org/W2952579308","https://openalex.org/W2962217072","https://openalex.org/W3004042307","https://openalex.org/W4302557773","https://openalex.org/W4379929132"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2418231958","https://openalex.org/W2387385213","https://openalex.org/W2899787781","https://openalex.org/W2381121915","https://openalex.org/W2074214908","https://openalex.org/W4242086819","https://openalex.org/W4206043061","https://openalex.org/W2942013815","https://openalex.org/W2390742649"],"abstract_inverted_index":{"Approximating":[0],"the":[1,4,21,86,100,103,119,144,162,170,187,190],"Pareto-set":[2],"of":[3,57,62,73,85,106,135,189],"multi-objective":[5],"minimum":[6],"spanning":[7],"tree":[8],"problem":[9,58],"(moMST)":[10],"is":[11],"a":[12,54,83,111,133,156],"challenging":[13],"task,":[14],"which":[15,129,160],"was":[16],"tackled":[17],"multiple":[18],"times":[19],"over":[20],"last":[22],"decades,":[23],"also":[24],"by":[25,76],"applying":[26,77],"evolutionary":[27],"approaches.":[28],"A":[29,182],"very":[30],"recent":[31],"work":[32,98],"introduced":[33,191],"two":[34],"novel":[35,157],"and":[36,65,109,173],"strongly":[37],"problem-tailored":[38],"sub-graph":[39,84],"based":[40],"mutation":[41,158],"operators":[42,51,70,108,122,145],"embedded":[43,125],"in":[44,60,164],"NSGA-II.":[45],"The":[46],"authors":[47],"show":[48,117],"that":[49,118],"these":[50,69,107],"excel":[52],"on":[53,102],"large":[55],"set":[56],"instances":[59],"terms":[61],"convergence":[63],"speed":[64],"approximation":[66],"quality.":[67],"Essentially,":[68],"replace":[71],"sub-trees":[72,131],"solution":[74],"candidates":[75],"Kruskal's":[78,136],"well-known":[79],"MST":[80],"algorithm":[81],"to":[82,90,143,169],"input":[87],"graph":[88],"reduced":[89],"scalar":[91],"edge":[92],"weights":[93],"via":[94],"weighted-sum":[95],"scalarisation.":[96],"This":[97],"changes":[99],"perspective":[101],"working":[104],"principle":[105],"proposes":[110],"more":[112],"general":[113],"construction":[114],"framework.":[115],"We":[116],"before":[120],"mentioned":[121],"can":[123],"be":[124],"into":[126],"this":[127],"framework,":[128],"'rewires'":[130],"using":[132],"generalisation":[134],"algorithm.":[137],"Additionally,":[138],"we":[139],"introduce":[140,155],"several":[141],"improvements":[142],"reducing":[146],"their":[147,153],"running":[148],"time":[149],"significantly":[150],"without":[151],"deteriorating":[152],"effectiveness,":[154],"operator,":[159],"utilises":[161],"framework":[163],"an":[165],"insertion-first":[166],"approach":[167],"(contrary":[168],"other":[171],"operators),":[172],"derive":[174],"theoretical":[175],"runtime":[176],"bounds":[177],"for":[178],"all":[179],"considered":[180],"operators.":[181],"short":[183],"benchmark":[184],"study":[185],"demonstrates":[186],"effectiveness":[188],"approach.":[192]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}