Exact and approximation algorithms for covering timeline in temporal graphs

We consider a variant of vertex cover on temporal graphs that has been recently defined for summarization of timeline activities in temporal graphs. The problem has been proved to be NP-hard, even for several restrictions of the time domain and vertex degree. We present novel algorithmic contributio...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of operations research Jg. 351; H. 1; S. 609 - 628
Hauptverfasser:	Dondi, Riccardo, Popa, Alexandru
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.08.2025 Springer Nature B.V
Schlagworte:	Algorithms Apexes Approximation Business and Management Combinatorics Graph theory Graphs Linear programming Operations Research/Decision Theory Original Research Theory of Computation Timeline cover Temporal graph FPT algorithm NP-hard problem Approximation algorithm
ISSN:	0254-5330, 1572-9338
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!