Sublinear Time Algorithms and Complexity of Approximate Maximum Matching.
Soheil BehnezhadMohammad RoghaniAviad RubinsteinPublished in: STOC (2023)
Keyphrases
- computational complexity
- space complexity
- worst case
- maximum matching
- high computational complexity
- theoretical analysis
- computationally efficient
- computational cost
- optimization problems
- memory requirements
- linear programming
- special case
- orders of magnitude
- heuristic search
- significant improvement
- lower bound
- binary search trees
- learning algorithm