{"id":"https://openalex.org/W1558437238","doi":"https://doi.org/10.1007/s001860000059","title":"Note on the computational complexity of least core concepts for min-cost spanning tree games","display_name":"Note on the computational complexity of least core concepts for min-cost spanning tree games","publication_year":2000,"publication_date":"2000-09-21","ids":{"openalex":"https://openalex.org/W1558437238","doi":"https://doi.org/10.1007/s001860000059","mag":"1558437238"},"language":"en","primary_location":{"id":"doi:10.1007/s001860000059","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s001860000059","pdf_url":null,"source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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":"Mathematical Methods of Operations Research (ZOR)","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1525312","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015850195","display_name":"Ulrich Faigle","orcid":"https://orcid.org/0000-0002-4477-5479"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Ulrich Faigle","raw_affiliation_strings":["Mathematisches Institut/ZAIK, Universit\u00e4t zu K\u00f6ln, Weyertal 80, D-50931 K\u00f6ln, Germany (","Mathematisches Institut/ZAIK, Universit\u00e4t zu K\u00f6ln, Weyertal 80, D-50931 K\u00f6ln, Germany (E-mail: faigle@zpr.uni-koeln.de), DE"],"affiliations":[{"raw_affiliation_string":"Mathematisches Institut/ZAIK, Universit\u00e4t zu K\u00f6ln, Weyertal 80, D-50931 K\u00f6ln, Germany (","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":"Mathematisches Institut/ZAIK, Universit\u00e4t zu K\u00f6ln, Weyertal 80, D-50931 K\u00f6ln, Germany (E-mail: faigle@zpr.uni-koeln.de), DE","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056030509","display_name":"Walter Kern","orcid":null},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Walter Kern","raw_affiliation_strings":["Mathematisches Institut/ZAIK, Universit\u00e4t zu K\u00f6ln, Weyertal 80, D-50931 K\u00f6ln, Germany (","Mathematisches Institut/ZAIK, Universit\u00e4t zu K\u00f6ln, Weyertal 80, D-50931 K\u00f6ln, Germany (E-mail: faigle@zpr.uni-koeln.de), DE"],"affiliations":[{"raw_affiliation_string":"Mathematisches Institut/ZAIK, Universit\u00e4t zu K\u00f6ln, Weyertal 80, D-50931 K\u00f6ln, Germany (","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":"Mathematisches Institut/ZAIK, Universit\u00e4t zu K\u00f6ln, Weyertal 80, D-50931 K\u00f6ln, Germany (E-mail: faigle@zpr.uni-koeln.de), DE","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027487467","display_name":"Dani\u00ebl Paulusma","orcid":"https://orcid.org/0000-0001-5945-9287"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniël Paulusma","raw_affiliation_strings":["Mathematisches Institut/ZAIK, Universit\u00e4t zu K\u00f6ln, Weyertal 80, D-50931 K\u00f6ln, Germany (","Mathematisches Institut/ZAIK, Universit\u00e4t zu K\u00f6ln, Weyertal 80, D-50931 K\u00f6ln, Germany (E-mail: faigle@zpr.uni-koeln.de), DE"],"affiliations":[{"raw_affiliation_string":"Mathematisches Institut/ZAIK, Universit\u00e4t zu K\u00f6ln, Weyertal 80, D-50931 K\u00f6ln, Germany (","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":"Mathematisches Institut/ZAIK, Universit\u00e4t zu K\u00f6ln, Weyertal 80, D-50931 K\u00f6ln, Germany (E-mail: faigle@zpr.uni-koeln.de), DE","institution_ids":["https://openalex.org/I180923762"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015850195"],"corresponding_institution_ids":["https://openalex.org/I180923762"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.1198,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.85683201,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"52","issue":"1","first_page":"23","last_page":"38"},"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/T11031","display_name":"Game Theory and Applications","score":0.9984999895095825,"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/T11182","display_name":"Auction Theory and Applications","score":0.9973999857902527,"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.8015134334564209},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.6880108714103699},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6225818991661072},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6137896180152893},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5545512437820435},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5108108520507812},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4961751401424408},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46575671434402466},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45683664083480835},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4499805271625519},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.438916951417923},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4356801509857178},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3376772999763489},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2091166377067566},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07945126295089722}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8015134334564209},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.6880108714103699},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6225818991661072},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6137896180152893},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5545512437820435},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5108108520507812},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4961751401424408},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46575671434402466},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45683664083480835},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4499805271625519},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.438916951417923},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4356801509857178},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3376772999763489},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2091166377067566},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07945126295089722},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1007/s001860000059","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s001860000059","pdf_url":null,"source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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":"Mathematical Methods of Operations Research (ZOR)","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/5d656242-ea14-44f5-b8bf-a17cb4119218","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/5d656242-ea14-44f5-b8bf-a17cb4119218","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Faigle, U, Kern, W & Paulusma, D 2000, 'Note on the computational complexity of least core concepts for min-cost spanning tree games', Mathematical methods of operations research, vol. 2000, no. 52, pp. 23-38. https://doi.org/10.1007/s001860000059","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:e-archive.informatik.uni-koeln.de:361","is_oa":false,"landing_page_url":"http://e-archive.informatik.uni-koeln.de/361/1/zaik1999-361.ps","pdf_url":null,"source":{"id":"https://openalex.org/S4306401304","display_name":"Computer Science Publication Server (University of Cologne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180923762","host_organization_name":"University of Cologne","host_organization_lineage":["https://openalex.org/I180923762"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.39.8379","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8379","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.zpr.uni-koeln.de/~faigle/flcore.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.476","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.fundp.ac.be/~fmanique/conference/extended.ps","raw_type":"text"},{"id":"pmh:oai:RePEc:spr:compst:v:52:y:2000:i:1:p:23-38","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s001860000059","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":"","raw_type":"article"},{"id":"pmh:oai:durham-repository.worktribe.com:1525312","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1525312","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/e9c91b70-5eff-4ac7-9bd0-7c7e5b635775","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/e9c91b70-5eff-4ac7-9bd0-7c7e5b635775","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},{"id":"mag:1558437238","is_oa":false,"landing_page_url":"https://www.narcis.nl/publication/RecordID/oai%3Aris.utwente.nl%3Apublications%2Fe9c91b70-5eff-4ac7-9bd0-7c7e5b635775","pdf_url":null,"source":{"id":"https://openalex.org/S2764466714","display_name":"Memorandum - Technische Hogeschool Twente, Onderafdeling der Toegepaste Wiskunde","issn_l":"0169-2690","issn":["0169-2690"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Memorandum - Technische Hogeschool Twente, Onderafdeling der Toegepaste Wiskunde","raw_type":null}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1525312","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1525312","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1966848756","https://openalex.org/W1989872469","https://openalex.org/W1995443028","https://openalex.org/W2007491585","https://openalex.org/W2011039300","https://openalex.org/W2073202637","https://openalex.org/W2101421259","https://openalex.org/W2125363721","https://openalex.org/W2133953743","https://openalex.org/W2144846366"],"related_works":["https://openalex.org/W2165116885","https://openalex.org/W1843403144","https://openalex.org/W1591768842","https://openalex.org/W3124442596","https://openalex.org/W2477124885","https://openalex.org/W136747014","https://openalex.org/W1532690141","https://openalex.org/W2186461377","https://openalex.org/W1991997415","https://openalex.org/W2146083290","https://openalex.org/W2071205675","https://openalex.org/W2096544426","https://openalex.org/W2138987445","https://openalex.org/W3189841424","https://openalex.org/W2292459874","https://openalex.org/W2087216833","https://openalex.org/W2296100593","https://openalex.org/W3040948693","https://openalex.org/W1983160860","https://openalex.org/W170376876"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}