The Traveling Salesman Problem under squared Euclidean distances (Q3113753): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
label / enlabel / en
 
The Traveling Salesman Problem under squared Euclidean distances
Property / OpenAlex ID
 
Property / OpenAlex ID: W1570186883 / rank
 
Normal rank
Property / title
 
The Traveling Salesman Problem under squared Euclidean distances (English)
Property / title: The Traveling Salesman Problem under squared Euclidean distances (English) / rank
 
Normal rank

Revision as of 10:57, 30 July 2024

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