The computational complexity of the elimination problem in generalized sports competitions

DOI10.1016/j.disopt.2003.12.003zbMath1087.90010OpenAlexW2014896310MaRDI QIDQ2386202

Daniël Paulusma, Walter Kern

Publication date: 22 August 2005

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/the-computational-complexity-of-the-elimination-problem-in-generalized-sports-competitions(6c676c2f-f5fa-457b-be23-6d14ac44ba3c).html

zbMATH Keywords

NP-completeNetwork flowElimination problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)

Related Items

Soccer is Harder Than Football, Refining the complexity of the sports elimination problem, On the complexity of bribery and manipulation in tournaments with uncertain information, Tournament schedules and incentives in a double round‐robin tournament with four teams, A connection between sports and matroids: how many teams can we beat?, Fixing balanced knockout and double elimination tournaments, Determining the results of tournament games using complete graphs generation

Cites Work

• A New Property and a Faster Algorithm for Baseball Elimination
• Possible Winners in Partially Completed Tournaments
• The new FIFA rules are hard: Complexity aspects of sports competitions.
• The structure and complexity of sports elimination numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item