Exact and approximation algorithms for covering timeline in temporal graphs (Q6945269)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8077848
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and approximation algorithms for covering timeline in temporal graphs |
scientific article; zbMATH DE number 8077848 |
Statements
Exact and approximation algorithms for covering timeline in temporal graphs (English)
0 references
9 August 2025
0 references
timeline cover
0 references
temporal graph
0 references
NP-hard problem
0 references
approximation algorithm
0 references
FPT algorithm
0 references
0 references
0 references
