Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams.
Jacques DarkChristian KonradPublished in: CoRR (2020)
Keyphrases
- vertex cover
- lower bound
- approximation algorithms
- worst case
- optimality criterion
- upper bound
- optimal solution
- np hard
- dynamic programming
- closed form
- branch and bound algorithm
- dynamic graph
- computer vision
- planar graphs
- constant factor
- branch and bound
- state space
- data streams
- objective function
- evaluation function
- log likelihood
- scheduling problem