An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197)

From MaRDI portal
Revision as of 01:48, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
An improved upper bound for the TSP in cubic 3-edge-connected graphs
scientific article

    Statements

    An improved upper bound for the TSP in cubic 3-edge-connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 August 2005
    0 references
    approximation algorithms
    0 references
    traveling salesman problem
    0 references
    graphs
    0 references
    regular graphs
    0 references

    Identifiers