Traveling Salesman Problems in Temporal Graphs
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12032
- Type
- D - Journal article
- DOI
-
10.1016/j.tcs.2016.04.006
- Title of journal
- Theoretical Computer Science
- Article number
- -
- First page
- 1
- Volume
- 634
- Issue
- -
- ISSN
- 0304-3975
- Open access status
- Compliant
- Month of publication
- April
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 20
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of this paper appeared at MFCS'14. It introduced new temporal models of graph exploration and the travelling salesman problem. Follow-up work based on these models include "On Temporal Graph Exploration" (ICALP'15) and "Two Moves per Time Step Make a Difference" (ICALP'19). The results of this paper constitute a significant part of the survey "An Introduction to Temporal Graphs: An Algorithmic Perspective" of Michail (Internet Mathematics 2016), now a de facto reference in the area. The paper underpins EPSRC Grant EP/P02002X/1 "Algorithmic Aspects of Temporal Graphs".
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -