A New Property and a Faster Algorithm for Baseball Elimination
From MaRDI portal
Publication:2719163
DOI10.1137/S0895480198348847zbMath0978.68069OpenAlexW1980618969MaRDI QIDQ2719163
Publication date: 21 June 2001
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480198348847
Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
The computational complexity of the elimination problem in generalized sports competitions ⋮ Soccer is Harder Than Football ⋮ Refining the complexity of the sports elimination problem ⋮ A connection between sports and matroids: how many teams can we beat?
This page was built for publication: A New Property and a Faster Algorithm for Baseball Elimination
