An Improved Approximation Algorithm for the Traveling Tournament Problem (Q3652254): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_69 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1826355535 / rank | |||
Normal rank | |||
Latest revision as of 21:47, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Improved Approximation Algorithm for the Traveling Tournament Problem |
scientific article |
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
