Publication:5002837

From MaRDI portal
Revision as of 11:04, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


DOI10.4230/LIPIcs.ICALP.2018.148zbMath1499.68243MaRDI QIDQ5002837

Eleni C. Akrida, George B. Mertzios, Victor Zamaraev, Paul G. Spirakis

Publication date: 28 July 2021


zbMATH Keywords

approximation algorithm; exponential time hypothesis; APX-hardness; temporal networks; temporal vertex cover


Mathematics Subject Classification ID

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


Related Items

The complexity of finding small separators in temporal graphs, Temporal vertex cover with a sliding time window, How fast can we reach a target vertex in stochastic temporal graphs?


Uses Software


Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5002837&oldid=19458372"
Powered by MediaWiki