On the complexity of Slater's problems
From MaRDI portal
Publication:1043351
DOI10.1016/j.ejor.2009.07.034zbMath1176.90606OpenAlexW2037898953MaRDI QIDQ1043351
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.07.034
Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
More results on the complexity of identifying problems in graphs ⋮ A linear ordering problem of sets ⋮ Maximum distance between Slater orders and Copeland orders of tournaments ⋮ On the computation of median linear orders, of median complete preorders and of median weak orders ⋮ An axiomatic characterization of the Slater rule ⋮ Voting Procedures, Complexity of ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ \(k\)-majority digraphs and the hardness of voting with a constant number of voters ⋮ A survey on the complexity of tournament solutions ⋮ Complexity results for extensions of median orders to different types of remoteness
Cites Work
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- A survey on the complexity of tournament solutions
- Sophisticated voting outcomes and agenda control
- The median procedure in cluster analysis and social choice theory
- Tournament solutions and majority voting
- A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
- Banks winners in tournaments are difficult to recognize
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
- Ranking Tournaments
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the complexity of Slater's problems
