A Connection Between Sports and Matroids: How Many Teams Can We Beat?

Abstract

Given an on-going sports competition, with each team having a current score and some matches left to be played, we ask whether it is possible for our distinguished team t to obtain a final standing with at most r teams finishing before t. We study the computational complexity of this problem, addressing it both from the viewpoint of parameterized complexity… (More)
DOI: 10.1007/s00453-016-0256-2

Topics

  • Presentations referencing similar topics