Approximating the metric TSP in linear time (Q649110)

From MaRDI portal
Revision as of 14:11, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Approximating the metric TSP in linear time
scientific article

    Statements

    title
    Approximating the metric TSP in linear time (English)
    0 references
    author
    Davide Bilò
    0 references
    Luca Forlizzi
    0 references
    Guido Proietti
    0 references
    publication date
    30 November 2011
    0 references
    zbMATH Keywords
    traveling salesman problem
    0 references
    metric graphs
    0 references
    NP-hardness
    0 references
    linear-time approximation algorithms
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    68R10
    0 references
    68W25
    0 references
    zbMATH DE Number
    5982660
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q649110&oldid=23290806"
    Powered by MediaWiki