Abstract
Some tasks require careful long-term planning. An example is the game schedule for the Bundesliga, the German football league, which must take into account various constraints. In order to describe an algorithm for the generation of schedules the author models the problem using an important concept in computer science, the graph.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Knust, S. (2011). Scheduling of Tournaments or Sports Leagues. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-15328-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15327-3
Online ISBN: 978-3-642-15328-0
eBook Packages: Computer ScienceComputer Science (R0)