Publication

Construction of balanced sports schedules using partitions into subleagues

Dominique de Werra, Tinaz Ekim
2008
Journal Articles

Abstract

Direct constructions for balanced tournaments known so far solve problems with 2n teams if 2n mod 3 not equal 1 or 2n = 2(p), p >= 3 or n is odd. Our construction uses an arbitrary partition of the league into subleagues. It solves more than half of the missing cases and provides structured solutions for some known cases. (C) 2007 Elsevier B.V. All rights reserved.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Construction of balanced sports schedules using partitions into subleagues

Chat with Graph Search

Teaching Not To

Rising from rubble - Leveraging existing construction tools for upcycling concrete waste into slender walls

FLO:RE – A new floor system made of reused reinforced concrete and steel elements