Publication:5002837
From MaRDI portal
DOI10.4230/LIPIcs.ICALP.2018.148zbMath1499.68243MaRDI QIDQ5002837
George B. Mertzios, Paul G. Spirakis, Victor Zamaraev, Eleni C. Akrida
Publication date: 28 July 2021
approximation algorithm; exponential time hypothesis; APX-hardness; temporal networks; temporal vertex cover
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Uses Software
