Recommendations
Cites work
- A note on maximizing the minimum voter satisfaction on spanning trees
- A simplified NP-complete MAXSAT problem
- An Analysis of Simple Voting Systems for Electing Committees
- Characterizations of the plurality function
- Cost monotonicity, consistency and minimum cost spanning tree games
- Maximizing the minimum voter satisfaction on spanning trees
- On cost allocation for a spanning tree: A game theoretic approach
- On the complexity of achieving proportional representation
- Optimal popular matchings
- Popular matchings: structure and algorithms
- Popular mixed matchings
- Sets of alternatives as Condorcet winners
- Sharing a minimal cost spanning tree: beyond the folk solution
- The Condorcet criterion and committee selection
- Voting schemes for which it can be difficult to tell who won the election
Cited in
(12)- Popular arborescences and their matroid generalization
- Popular branchings and their dual certificates
- A preference-based approach to spanning trees and shortest paths problems
- Maximizing the minimum voter satisfaction on spanning trees
- It is difficult to tell if there is a Condorcet spanning tree
- A note on maximizing the minimum voter satisfaction on spanning trees
- Finding socially best spanning treesî
- On weakly and strongly popular rankings
- Popular branchings and their dual certificates
- Popular matchings with weighted voters
- Computational complexity of \(k\)-stable matchings
- The traveling group problem
This page was built for publication: Popular spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404516)
