Tight competitive analyses of online car-sharing problems (Q2089695)

From MaRDI portal
Revision as of 14:02, 30 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Tight competitive analyses of online car-sharing problems
scientific article

    Statements

    title
    Tight competitive analyses of online car-sharing problems (English)
    0 references
    author
    Ya-Chun Liang
    0 references
    Kuan-Yun Lai
    0 references
    Ho-Lin Chen
    0 references
    Kazuo Iwama
    0 references
    Chung-Shou Liao
    0 references
    publication date
    24 October 2022
    0 references
    zbMATH Keywords
    car-sharing
    0 references
    competitive analysis
    0 references
    on-line scheduling
    0 references
    randomized algorithm
    0 references

    Identifiers

    zbMATH DE Number
    7605957
    0 references
    OpenAlex ID
    W3158912225
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2089695&oldid=37447409"
    Powered by MediaWiki