A 2.75-approximation algorithm for the unconstrained traveling tournament problem (Q475199)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A 2.75-approximation algorithm for the unconstrained traveling tournament problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 2.75-approximation algorithm for the unconstrained traveling tournament problem |
scientific article |
Statements
A 2.75-approximation algorithm for the unconstrained traveling tournament problem (English)
0 references
26 November 2014
0 references
timetable
0 references
sports scheduling
0 references
traveling tournament problem
0 references
approximation algorithm
0 references
0.8988215923309326
0 references
0.8968377709388733
0 references
0.8560535311698914
0 references
0.8510104417800903
0 references
0.8462135195732117
0 references
