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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annals of operations research Ročník 351; číslo 1; s. 609 - 628
Hlavní autori:	Dondi, Riccardo, Popa, Alexandru
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2025 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!