Traveling Salesman Problems in Temporal Graphs

Spirakis, PG ORCID: 0000-0001-5396-3749 and Michail, O ORCID: 0000-0002-6234-3960 (2016) Traveling Salesman Problems in Temporal Graphs. Theoretical Computer Science, 634. 1 - 23.

Text tcs15withthon-TSP.pdf - Accepted Version Download (532kB)

Item Type:	Article
Uncontrolled Keywords:	dynamic network, exploration, TSP with costs one and two, temporal matching, approximation algorithm, hardness result
Depositing User:	Symplectic Admin
Date Deposited:	07 Jan 2019 11:15
Last Modified:	10 Aug 2022 06:10
DOI:	10.1016/j.tcs.2016.04.006
Related URLs:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3030816

Available Versions of this Item

• Traveling salesman problems in temporal graphs. (deposited 11 Apr 2016 10:48)
  • Traveling Salesman Problems in Temporal Graphs. (deposited 07 Jan 2019 11:15) [Currently Displayed]