Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139)

From MaRDI portal
Revision as of 15:09, 23 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
Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
scientific article

    Statements

    Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 November 2000
    0 references
    0 references
    undirected graph
    0 references
    clustered traveling salesman problem
    0 references
    shortest Hamiltonian cycle
    0 references