A 2.75-approximation algorithm for the unconstrained traveling tournament problem (Q475199): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6374067 / rank
 
Normal rank
Property / zbMATH Keywords
 
timetable
Property / zbMATH Keywords: timetable / rank
 
Normal rank
Property / zbMATH Keywords
 
sports scheduling
Property / zbMATH Keywords: sports scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
traveling tournament problem
Property / zbMATH Keywords: traveling tournament problem / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / rank
 
Normal rank

Revision as of 18:42, 30 June 2023

scientific article
Language Label Description Also known as
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
    0 references
    0 references
    0 references
    26 November 2014
    0 references
    timetable
    0 references
    sports scheduling
    0 references
    traveling tournament problem
    0 references
    approximation algorithm
    0 references

    Identifiers