An Improved Approximation Algorithm for the Traveling Tournament Problem (Q3652254)
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 5649420
| 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 5649420 |
Statements
An Improved Approximation Algorithm for the Traveling Tournament Problem (English)
0 references
17 December 2009
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.9785534
0 references
0.9638176
0 references
0.94547325
0 references
0.9396083
0 references
0.9290491
0 references
0.92240524
0 references
0.9103501
0 references
