An explicit lower bound for TSP with distances one and two (Q1402211)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An explicit lower bound for TSP with distances one and two
scientific article

    Statements

    An explicit lower bound for TSP with distances one and two (English)
    0 references
    0 references
    0 references
    19 August 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman problem
    0 references
    approximability
    0 references
    gadget reductions
    0 references
    lower bounds
    0 references
    0 references