Login / Signup

Deterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊2) Amortized Update Time.

Sayan BhattacharyaJanardhan Kulkarni
Published in: SODA (2019)
Keyphrases
  • worst case
  • search tree
  • data sets
  • neural network
  • information systems
  • data mining
  • evolutionary algorithm
  • multiresolution
  • hidden markov models