Refining the complexity of the sports elimination problem
From MaRDI portal
Publication:896666
DOI10.1016/j.dam.2015.01.021zbMath1326.05129OpenAlexW1979918272MaRDI QIDQ896666
Eva Potpinková, Ildikó Schlotter, Katarína Cechlárova
Publication date: 10 December 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.01.021
Related Items (2)
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?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday
- Baseball playoff eliminations: An application of linear programming. Erratum
- A fast algorithm for the generalized parametric minimum cut problem and applications
- Treewidth. Computations and approximations
- Bin packing with fixed number of bins revisited
- The computational complexity of the elimination problem in generalized sports competitions
- A New Property and a Faster Algorithm for Baseball Elimination
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- New Races in Parameterized Algorithmics
- Integer Programming with a Fixed Number of Variables
- Reflections on Multivariate Algorithmics and Problem Parameterization
- On Feedback Vertex Set New Measure and New Structures
- Minkowski's Convex Body Theorem and Integer Programming
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
- 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
This page was built for publication: Refining the complexity of the sports elimination problem
