An upper bound for the shortest hamiltonian path in the symmetric euclidean case

DOI10.1051/RO/1983170302971zbMATH Open0524.05042OpenAlexW2544897378MaRDI QIDQ3037474

Ioan Tomescu

Publication date: 1983

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104837

zbMATH Keywords

diameterspanning treeHamiltonian pathcomplete weighted graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Algorithms in computer science (68W99)

This page was built for publication: An upper bound for the shortest hamiltonian path in the symmetric euclidean case