Approximation algorithms for the traveling salesman problem (Q1812290)

From MaRDI portal
Revision as of 18:10, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximation algorithms for the traveling salesman problem
scientific article

    Statements

    title
    Approximation algorithms for the traveling salesman problem (English)
    0 references
    author
    Jérôme Monnot
    0 references
    Vangelis Th. Paschos
    0 references
    Sophie Toulouse
    0 references
    publication date
    23 June 2003
    0 references
    zbMATH Keywords
    approximation algorithm
    0 references
    NP-complete problem
    0 references
    traveling salesman
    0 references

    Identifiers

    DOI
    10.1007/s001860200239
    0 references
    Mathematics Subject Classification ID
    90C35
    0 references
    68W25
    0 references
    90C27
    0 references
    90C60
    0 references
    90C59
    0 references
    zbMATH DE Number
    1932769
    0 references
    OpenAlex ID
    W2004153594
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1812290&oldid=31261069"
    Powered by MediaWiki