Skip to main content

ETHNOS_APP

Home • Search • Journals • List 0

Maximizing the minimum voter satisfaction on spanning trees

Bibliographic Data

ID11285120
AuthorsAndreas Darmann (0000-0002-0477-4578, University of Graz, corresponding author), Christian Klamler (0000-0003-1225-5943, University of Graz), Ulrich Pferschy (0000-0001-8881-1497, University of Graz)
Year2009
Volume58
Issue2
Pages238-250
Publication date2009-09-01
Open AccessYes
TypeARTICLE
VenueMathematical Social Sciences (JOURNAL)
Journal identifiersISSN: 0165-4896 • E-ISSN: 1879-3118
PublisherElsevier BV (PUBLISHER)
DOI10.1016/j.mathsocsci.2009.05.002
OpenAlexW3125944074
LanguageEN
Citations received2
References cited7

Approval voting · Cardinal voting systems · Combinatorics · Graph · Mathematical optimization · Minimax · Minimum spanning tree · Political science · Spanning tree · Voting · Advanced Graph Theory Research · Complexity and Algorithms in Graphs · Computer Science · Game Theory and Voting Systems · Mathematics

  • A note on maximizing the minimum voter satisfaction on spanning trees

    Open Access•Andreas Darmann, Christian Klamler et al.•Mathematical Social Sciences•2010

  • How hard is it to tell which is a Condorcet committee

    Open Access•Andreas Darmann•Mathematical Social Sciences•2013

  • Characterizations of the plurality function

    Open Access•Fred S Roberts•Mathematical Social Sciences•1991

Citations per year0.13
Citation span2010 - 2013 (4)
Highly citedNo

Tools

Open DOISci-Hub
Ethnos_APP • Open Source Project • MIT License • Frontend v2.0.0 • Privacy and Cookies • API Documentation: api.ethnos.app/docs • API Source Code: GitHub • DOI: 10.5281/zenodo.17049435 • Frontend Source Code: GitHub • DOI: 10.5281/zenodo.17050053 • cruz.rio.br • Expectantes Misericordiae