The Traveling Salesman Problem under squared Euclidean distances (Q3113753)

From MaRDI portal
Revision as of 16:57, 20 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Traveling Salesman Problem under squared Euclidean distances
scientific article

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    23 January 2012
    0 references
    geometric traveling salesman problem
    0 references
    power-assignment in wireless networks
    0 references
    distance-power gradient
    0 references
    NP-hard
    0 references
    APX-hard
    0 references
    The Traveling Salesman Problem under squared Euclidean distances (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references