Maximizing the minimum voter satisfaction on spanning trees
Bibliographic Data
| ID | 11285120 |
|---|---|
| Authors | Andreas 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) |
| Year | 2009 |
| Volume | 58 |
| Issue | 2 |
| Pages | 238-250 |
| Publication date | 2009-09-01 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Mathematical Social Sciences (JOURNAL) |
| Journal identifiers | ISSN: 0165-4896 • E-ISSN: 1879-3118 |
| Publisher | Elsevier BV (PUBLISHER) |
| DOI | 10.1016/j.mathsocsci.2009.05.002 |
| OpenAlex | W3125944074 |
| Language | EN |
| Citations received | 2 |
| References cited | 7 |
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
| Citations per year | 0.13 |
|---|---|
| Citation span | 2010 - 2013 (4) |
| Highly cited | No |