When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree (Q4507360)

From MaRDI portal
scientific article; zbMATH DE number 1519262
Language Label Description Also known as
English
When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
scientific article; zbMATH DE number 1519262

    Statements

    When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree (English)
    0 references
    0 references
    18 October 2000
    0 references
    computational complexity
    0 references
    combinatorial optimization
    0 references
    hardness of approximation
    0 references
    traveling salesman problem
    0 references
    Steiner tree problem
    0 references

    Identifiers