Traveling Salesman Problems in Temporal Graphs

DOI10.1007/978-3-662-44465-8_47zbMath1426.90218OpenAlexW355401516MaRDI QIDQ2922641

Othon Michail, Paul G. Spirakis

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_47

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (9)

Traveling salesman problems in temporal graphs ⋮ A Glimpse at Paul G. Spirakis ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ On temporal graph exploration ⋮ Temporal flows in temporal networks ⋮ Edge exploration of temporal graphs ⋮ Approximating multistage matching problems ⋮ Approximating multistage matching problems ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective^*

This page was built for publication: Traveling Salesman Problems in Temporal Graphs