An Improved Approximation Algorithm for the Traveling Tournament Problem (Q3652254)

From MaRDI portal
Revision as of 21:47, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An Improved Approximation Algorithm for the Traveling Tournament Problem
scientific article

    Statements

    title
    An Improved Approximation Algorithm for the Traveling Tournament Problem (English)
    0 references
    author
    Daisuke Yamaguchi
    0 references
    Ryuhei Miyashiro
    0 references
    Shinji Imahori
    0 references
    Tomomi Matsui
    0 references
    publication date
    17 December 2009
    0 references
    zbMATH Keywords
    traveling tournament problem
    0 references
    approximation algorithm
    0 references
    lower bound
    0 references
    timetabling
    0 references
    scheduling
    0 references

    Identifiers

    zbMATH DE Number
    5649420
    0 references
    OpenAlex ID
    W1826355535
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3652254&oldid=32040039"
    Powered by MediaWiki