We study sublinear time algorithms for estimating the size of maximum matching. After a
long line of research, the problem was finally settled by Behnezhad ‍ [FOCS'22], in the …

We study algorithms for estimating the size of maximum matching. This problem has been
subject to extensive research. For n-vertex graphs, Bhattacharya, Kiss, and Saranurak …

A constraint satisfaction problem (CSP),, is specified by a finite set of constraints for positive
integers q and k. An instance of the problem on n variables is given by m applications of …

We study sublinear time algorithms for the traveling salesman problem (TSP). First, we focus
on the closely related maximum path cover problem, which asks for a collection of vertex …

In the metric Steiner Tree problem, we are given an n× n metric w on a set V of vertices
along with a set T⊆ V of k terminals, and the goal is to find a tree of minimum cost that …

Abstract Maximum Constraint satisfaction problems (Max-CSPs) are ubiquitous in computer
science and encompass optimization problems such as Max-CUT, Max-DICUT, Max-kSAT …

Let be an-point metric space. We assume that is given in the distance oracle model, that is,
and for every pair of points from we can query their distance in constant time. A-nearest …