Approximating the metric TSP in linear time (Q649110)

From MaRDI portal
Revision as of 17:01, 3 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximating the metric TSP in linear time
scientific article

    Statements

    Approximating the metric TSP in linear time (English)
    0 references
    0 references
    0 references
    0 references
    30 November 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman problem
    0 references
    metric graphs
    0 references
    NP-hardness
    0 references
    linear-time approximation algorithms
    0 references