A Two-Pass (Conditional) Lower Bound for Semi-Streaming Maximum Matching.
Sepehr AssadiPublished in: SODA (2022)
Keyphrases
- maximum matching
- lower bound
- bipartite graph
- upper bound
- stable set
- branch and bound algorithm
- branch and bound
- objective function
- data streams
- lower and upper bounds
- streaming data
- np hard
- real time
- worst case
- sufficiently accurate
- video streaming
- linear programming relaxation
- optimal solution
- polynomial approximation
- random field model
- collaborative filtering
- stream processing
- social networks
- decision trees
- scalable video
- max sat
- reinforcement learning
- dynamic programming
- active learning