{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T08:08:20Z","timestamp":1777622900971,"version":"3.51.4"},"reference-count":17,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,8]]},"abstract":"<jats:p> Combinatorial Optimization is combined with Social Choice Theory when the goal is to decide on the quality of a spanning tree of an undirected graph. Given individual preferences over the edges of the graph, spanning trees are compared by means of a Condorcet criterion. The comparisons are based on scoring functions used in classic voting rules such as approval voting and Borda voting. In this work, we investigate the computational complexity involved in deciding on the quality of a spanning tree with respect to the different voting rules adapted. In particular, we draw the sharp separation line between polynomially solvable and computationally intractable instances. <\/jats:p>","DOI":"10.1142\/s0129054113500226","type":"journal-article","created":{"date-parts":[[2013,10,24]],"date-time":"2013-10-24T04:39:43Z","timestamp":1382589583000},"page":"655-677","source":"Crossref","is-referenced-by-count":8,"title":["POPULAR SPANNING TREES"],"prefix":"10.1142","volume":"24","author":[{"given":"ANDREAS","family":"DARMANN","sequence":"first","affiliation":[{"name":"Institute of Public Economics, University of Graz, Universitaetsstr. 15, A-8010 Graz, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,10,24]]},"reference":[{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00303169"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230060404"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2009.11.001"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2009.05.002"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2010.04.003"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2003.09.008"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-011-9188-z"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1137\/0141041"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1002\/bs.3830200304"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1016\/0165-4896(85)90043-5"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.06.004"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.03.028"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1007\/s003550200194"},{"key":"p_27","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9287-9"},{"key":"p_29","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-007-0235-2"},{"key":"p_30","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00223-8"},{"key":"p_31","doi-asserted-by":"publisher","DOI":"10.1016\/0165-4896(91)90074-2"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113500226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T10:51:47Z","timestamp":1565175107000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113500226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":17,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2013,10,24]]},"published-print":{"date-parts":[[2013,8]]}},"alternative-id":["10.1142\/S0129054113500226"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113500226","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}