The Traveling Salesman Problem with Distances One and Two (Q4697080)

From MaRDI portal
Revision as of 16:28, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/mor/PapadimitriouY93, #quickstatements; #temporary_batch_1731508824982)





scientific article; zbMATH DE number 221601
Language Label Description Also known as
English
The Traveling Salesman Problem with Distances One and Two
scientific article; zbMATH DE number 221601

    Statements

    The Traveling Salesman Problem with Distances One and Two (English)
    0 references
    29 June 1993
    0 references
    polynomial-time approximation algorithm
    0 references
    traveling salesman
    0 references
    weighted graphs
    0 references
    subtour patching
    0 references

    Identifiers