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
Set OpenAlex properties.
m rollbackEdits.php mass rollback
Tag: Rollback
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(91)90118-2 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009175527 / rank
Normal rank
 

Revision as of 09:31, 20 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