{"id":"https://openalex.org/W1843403144","doi":"https://doi.org/10.1007/s13675-015-0042-y","title":"Generalized minimum spanning tree games","display_name":"Generalized minimum spanning tree games","publication_year":2015,"publication_date":"2015-07-31","ids":{"openalex":"https://openalex.org/W1843403144","doi":"https://doi.org/10.1007/s13675-015-0042-y","mag":"1843403144"},"language":"en","primary_location":{"id":"doi:10.1007/s13675-015-0042-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-015-0042-y","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1007/s13675-015-0042-y","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039495491","display_name":"Phuoc Hoang Le","orcid":"https://orcid.org/0000-0002-3554-4206"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"PhuocHoang Le","raw_affiliation_strings":["Southampton Business School and Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, SO17 1BJ, Southampton, UK","University of Southampton"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southampton Business School and Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, SO17 1BJ, Southampton, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"University of Southampton","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082841553","display_name":"Tri-Dung Nguyen","orcid":"https://orcid.org/0000-0002-4158-9099"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tri-Dung Nguyen","raw_affiliation_strings":["Southampton Business School and Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, SO17 1BJ, Southampton, UK","University of Southampton"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southampton Business School and Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, SO17 1BJ, Southampton, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"University of Southampton","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021959924","display_name":"Tolga Bekta\u015f","orcid":"https://orcid.org/0000-0003-0634-144X"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tolga Bekta\u015f","raw_affiliation_strings":["Southampton Business School and Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, SO17 1BJ, Southampton, UK","University of Southampton"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southampton Business School and Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, SO17 1BJ, Southampton, UK","institution_ids":["https://openalex.org/I43439940"]},{"raw_affiliation_string":"University of Southampton","institution_ids":["https://openalex.org/I43439940"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039495491"],"corresponding_institution_ids":["https://openalex.org/I43439940"],"apc_list":{"value":1400,"currency":"USD","value_usd":1400},"apc_paid":{"value":1400,"currency":"USD","value_usd":1400},"fwci":1.0801,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.86275837,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"4","issue":"2","first_page":"167","last_page":"188"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8120192289352417},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7849290370941162},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6413686275482178},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5871774554252625},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.5604645609855652},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5461316108703613},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.5406290292739868},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.5334482789039612},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5195865631103516},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5071566104888916},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4821071922779083},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.47309187054634094},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47177624702453613},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4622255563735962},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.45125874876976013},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4261154234409332},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.368864506483078},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.2908632159233093},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.231756329536438},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.16287735104560852},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.1371828019618988},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.09218987822532654},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.05329263210296631}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8120192289352417},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7849290370941162},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6413686275482178},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5871774554252625},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.5604645609855652},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5461316108703613},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5406290292739868},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.5334482789039612},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5195865631103516},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5071566104888916},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4821071922779083},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.47309187054634094},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47177624702453613},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4622255563735962},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.45125874876976013},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4261154234409332},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.368864506483078},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2908632159233093},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.231756329536438},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.16287735104560852},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.1371828019618988},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.09218987822532654},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.05329263210296631}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s13675-015-0042-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-015-0042-y","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":"EURO Journal on Computational Optimization","raw_type":"journal-article"},{"id":"pmh:oai:eprints.soton.ac.uk:379367","is_oa":false,"landing_page_url":"http://doi.org/10.1007/s13675-015-0042-y>).","pdf_url":null,"source":{"id":"https://openalex.org/S4306401019","display_name":"ePrints Soton (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:RePEc:spr:eurjco:v:4:y:2016:i:2:d:10.1007_s13675-015-0042-y","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s13675-015-0042-y","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:doaj.org/article:d28e207ef285494bbd207cfa51dabe35","is_oa":true,"landing_page_url":"https://doaj.org/article/d28e207ef285494bbd207cfa51dabe35","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"EURO Journal on Computational Optimization, Vol 4, Iss 2, Pp 167-188 (2016)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s13675-015-0042-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-015-0042-y","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320277","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1422351985","https://openalex.org/W1554451661","https://openalex.org/W1965680834","https://openalex.org/W1966848756","https://openalex.org/W1975617599","https://openalex.org/W1995443028","https://openalex.org/W2017927472","https://openalex.org/W2021178645","https://openalex.org/W2021200112","https://openalex.org/W2026348610","https://openalex.org/W2032789430","https://openalex.org/W2058237281","https://openalex.org/W2058634896","https://openalex.org/W2076332815","https://openalex.org/W2095374113","https://openalex.org/W2102152964","https://openalex.org/W2103267790","https://openalex.org/W2109797109","https://openalex.org/W2110105948","https://openalex.org/W2145457833","https://openalex.org/W2165842651","https://openalex.org/W2172255557","https://openalex.org/W2762227386","https://openalex.org/W3121841453","https://openalex.org/W3123101064","https://openalex.org/W3125415792","https://openalex.org/W4206636327"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W3016811403","https://openalex.org/W2518240130","https://openalex.org/W2059360098","https://openalex.org/W4380840098","https://openalex.org/W2048177396","https://openalex.org/W2387385213","https://openalex.org/W3081212354","https://openalex.org/W1561849181","https://openalex.org/W2418231958"],"abstract_inverted_index":{"The":[0,94],"minimum-cost":[1,45,69],"spanning":[2,46,62,84],"tree":[3,47,63,70,85],"game":[4,35,86],"is":[5,55,65],"a":[6,14,17,22,30,44,68,98,104],"special":[7],"class":[8],"of":[9,19,24,33,43,91],"cooperative":[10],"games":[11],"defined":[12],"on":[13],"graph":[15,54],"with":[16],"set":[18,23],"vertices":[20],"and":[21,87,108],"edges,":[25],"where":[26],"each":[27,76],"player":[28],"owns":[29],"vertex.":[31],"Solutions":[32],"the":[34,40,50,53,59,81,114],"represent":[36],"ways":[37],"to":[38,66,102],"distribute":[39],"total":[41],"cost":[42],"among":[48],"all":[49],"players.":[51],"When":[52],"partitioned":[56],"into":[57],"clusters,":[58],"generalized":[60,82],"minimum":[61,83],"problem":[64],"determine":[67],"including":[71],"exactly":[72],"one":[73],"vertex":[74],"from":[75],"cluster.":[77],"This":[78],"paper":[79,95],"introduces":[80],"studies":[88],"some":[89],"properties":[90],"this":[92],"game.":[93],"also":[96],"describes":[97],"constraint":[99],"generation":[100],"algorithm":[101],"calculate":[103],"stable":[105],"payoff":[106],"distribution":[107],"presents":[109],"computational":[110],"results":[111],"obtained":[112],"using":[113],"proposed":[115],"algorithm.":[116]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}