POPULAR SPANNING TREES
From MaRDI portal
Publication:5404516
DOI10.1142/S0129054113500226zbMath1283.68154MaRDI QIDQ5404516
Publication date: 24 March 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Popular Branchings and Their Dual Certificates ⋮ It is difficult to tell if there is a Condorcet spanning tree ⋮ On weakly and strongly popular rankings ⋮ Popular branchings and their dual certificates
Cites Work
- A simplified NP-complete MAXSAT problem
- Popular mixed matchings
- Popular matchings: structure and algorithms
- Cost monotonicity, consistency and minimum cost spanning tree games
- Maximizing the minimum voter satisfaction on spanning trees
- Optimal popular matchings
- Sharing a minimal cost spanning tree: beyond the folk solution
- A note on maximizing the minimum voter satisfaction on spanning trees
- The Condorcet criterion and committee selection
- Voting schemes for which it can be difficult to tell who won the election
- Characterizations of the plurality function
- On the complexity of achieving proportional representation
- Sets of alternatives as Condorcet winners
- An Analysis of Simple Voting Systems for Electing Committees
- On cost allocation for a spanning tree: A game theoretic approach
