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)...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 634; S. 1 - 23
Hauptverfasser:	Michail, Othon, Spirakis, Paul G.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 27.06.2016
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!