Traveling salesman problems in temporal graphs

In this work, we introduce the notion of time to some well-known combinatorial optimization problems. In particular, we study problems defined on temporal graphs. A temporal graph D=(V,A) may be viewed as a time-sequence G1,G2,…,Gl of static graphs over the same (static) set of nodes V. Each Gt=D(t)...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 634; pp. 1 - 23
Main Authors:	Michail, Othon, Spirakis, Paul G.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 27.06.2016
Subjects:	Algorithms Approximation Approximation algorithm Combinatorial analysis Constants Dynamic network Exploration Graphs Hardness result Mathematical analysis Optimization Temporal matching Tours TSP with costs one and two Exploration Dynamic network TSP with costs one and two Approximation algorithm Temporal matching Hardness result
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!