Login / Signup

Temporal vertex cover with a sliding time window.

Eleni C. AkridaGeorge B. MertziosPaul G. SpirakisViktor Zamaraev
Published in: J. Comput. Syst. Sci. (2020)
Keyphrases
  • vertex cover
  • approximation algorithms
  • partial order
  • planar graphs
  • precedence constraints
  • optimality criterion
  • polynomial time approximation
  • simulated annealing
  • sliding window
  • special case
  • scheduling problem