Temporal Vertex Cover with a Sliding Time Window.

Eleni C. Akrida George B. Mertzios Paul G. Spirakis Viktor Zamaraev

Published in: CoRR (2018)

Keyphrases

vertex cover
approximation algorithms
planar graphs
precedence constraints
sliding window
optimality criterion
polynomial time approximation
np hard
partial order
worst case
branch and bound algorithm