A note on maximizing the minimum voter satisfaction on spanning trees
Bibliographic Data
| ID | 11285453 |
|---|---|
| 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 | 2010 |
| Volume | 60 |
| Issue | 1 |
| Pages | 82-85 |
| Publication date | 2010-07-01 |
| Peer Reviewed | Yes |
| 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.2010.04.003 |
| OpenAlex | W3124102069 |
| Language | EN |
| Citations received | 1 |
| References cited | 5 |
Combinatorics · Graph · Mathematical optimization · Minimax · Minimum degree spanning tree · Minimum spanning tree · Spanning tree · Advanced Graph Theory Research · Complexity and Algorithms in Graphs · Computer Science · Game Theory and Voting Systems · Mathematics
| Unique citing works | 1 |
|---|---|
| Citations per year | 0.08 |
| Citation span | 2013 - 2013 (1) |
| Citation velocity | historical |
| Highly cited | No |
| Citation types | Neutral: 1 |