Sometimes travelling is easy: The master tour problem

DOI10.1007/3-540-60313-1_139zbMath1512.90235OpenAlexW2136299260MaRDI QIDQ6102296

Rüdiger Rudolf, Vladimir G. Deǐneko, Gerhard J. Woeginger

Publication date: 8 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/bf080276-a0d8-420f-9034-a2ec4d3c5c66

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Paths and cycles (05C38) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Perspectives of Monge properties in optimization

Cites Work

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Perspectives of Monge properties in optimization
• Edgeconvex Circuits and the Traveling Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sometimes travelling is easy: The master tour problem