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

DOI10.1016/0020-0190(91)90118-2zbMath0743.68079OpenAlexW2009175527MaRDI QIDQ1183480

Could not fetch data.

Publication date: 28 June 1992

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90118-2

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Could not fetch data.