Michail, Othon and Spirakis, Paul G
(2016)
Traveling salesman problems in temporal graphs.
THEORETICAL COMPUTER SCIENCE, 634.
1 - 23.
There is a more recent version of this item available. |
Text
tcs15withthon-TSP.pdf 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: | 11 Apr 2016 10:48 |
Last Modified: | 07 Jan 2019 11:15 |
DOI: | 10.1016/j.tcs.2016.04.006 |
URI: | http://livrepository.liverpool.ac.uk/id/eprint/3000147 |
Available Versions of this Item
- Traveling salesman problems in temporal graphs. (deposited 11 Apr 2016 10:48) [Currently Displayed]
Altmetric
CORE (COnnecting REpositories)