Optimal Sublinear Algorithms for Matching and Vertex Cover

We study the problem of estimating the size of maximum matching and minimum vertex cover in sublinear time. Denoting the number of vertices by n and the average degree in the graph by (d) over bar, we obtain the following results for both problems which are all provably time-optimal up to polylogarithmic factors:(1) A multiplicative (2+epsilon)-approximation that takes (O) over tilde (n/epsilon(2)) time using adjacency list queries. A multiplicative-additive (2, epsilon n)-approximation that takes (O) over tilde (((d) over bar/epsilon(2)) time using adjacency list queries. A multiplicative-additive (2, epsilon n)-approximation that takes (O) over tilde/epsilon(3)) time using adjacency list queries. Our main contribution and the key ingredient of the bounds above is a near-tight analysis of the average query complexity of randomized greedy maximal matching which improves upon a seminal result of Yoshida, Yamamoto, and Ito [STOC'09].