Traveling salesman problems in temporal graphs (Q284573)

From MaRDI portal
Revision as of 13:16, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Traveling salesman problems in temporal graphs
scientific article

    Statements

    title
    Traveling salesman problems in temporal graphs (English)
    0 references
    author
    Othon Michail
    0 references
    Paul G. Spirakis
    0 references
    publication date
    18 May 2016
    0 references
    zbMATH Keywords
    dynamic network
    0 references
    exploration
    0 references
    TSP with costs one and two
    0 references
    temporal matching
    0 references
    approximation algorithm
    0 references
    hardness result
    0 references
    cites work
    Q5417632
    0 references
    Q5689807
    0 references
    Q2721980
    0 references
    Q4659605
    0 references
    Q4886045
    0 references
    Q4736826
    0 references
    Q3002782
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    68Q17
    0 references
    68W25
    0 references
    90C35
    0 references
    90C59
    0 references
    zbMATH DE Number
    6581632
    0 references
    OpenAlex ID
    W2330664568
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q284573&oldid=38290241"
    Powered by MediaWiki