The structure and complexity of sports elimination numbers

DOI10.1007/s00453-001-0074-yzbMath0995.68054OpenAlexW1555156751MaRDI QIDQ5956833

Charles U. Martel, Dan Gusfield

Publication date: 28 February 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0074-y

zbMATH Keywords

combinatorial optimizationnetwork flow

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (6)

The computational complexity of the elimination problem in generalized sports competitions ⋮ 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

This page was built for publication: The structure and complexity of sports elimination numbers