Time-Optimal Sublinear Algorithms for Matching and Vertex Cover.

Soheil Behnezhad

Published in: FOCS (2021)

Keyphrases

vertex cover
worst case
optimality criterion
approximation algorithms
learning algorithm
computational complexity
upper bound
optimization problems
space complexity
planar graphs
optimal solution
theoretical analysis
combinatorial optimization
partial order