An improved approximation algorithm for the traveling tournament problem (Q652542)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5988477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved approximation algorithm for the traveling tournament problem |
scientific article; zbMATH DE number 5988477 |
Statements
An improved approximation algorithm for the traveling tournament problem (English)
0 references
14 December 2011
0 references
traveling tournament problem
0 references
approximation algorithm
0 references
lower bound
0 references
timetabling
0 references
scheduling
0 references
0.9999997
0 references
0.9785533
0 references
0.9638176
0 references
0.94547325
0 references
0.9396082
0 references
0.9290491
0 references
0.92240524
0 references
0.91034997
0 references
