A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 23:37, 4 March 2024

scientific article
Language Label Description Also known as
English
A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
scientific article

    Statements

    A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (English)
    0 references
    0 references
    28 June 1992
    0 references
    traveling salesman problem
    0 references
    dynamic programming algorithm
    0 references
    Monge arrays
    0 references

    Identifiers