research
∙
01/22/2023
On the size of maximum cut in planar graphs
We show that the size of maximum cut in a planar graph with m edges is a...
share
research
∙
11/08/2022
Streaming beyond sketching for Maximum Directed Cut
We give an O(√(n))-space single-pass 0.483-approximation streaming algor...
research
∙
09/12/2022
An Improved Lower Bound for Matroid Intersection Prophet Inequalities
We consider prophet inequalities subject to feasibility constraints that...
research
∙
07/14/2022
Streaming complexity of CSPs with randomly ordered constraints
We initiate a study of the streaming complexity of constraint satisfacti...
research
∙
05/04/2022
Sketching Approximability of (Weak) Monarchy Predicates
We analyze the sketching approximability of constraint satisfaction prob...
research
∙
02/10/2022
Fair allocation of a multiset of indivisible items
We study the problem of allocating a set M of m indivisible items among ...
research
∙
12/12/2021
Closed-form expressions for the sketching approximability of (some) symmetric Boolean CSPs
A Boolean maximum constraint satisfaction problem, Max-CSP(f), is specif...
research
∙
06/24/2021
Linear Space Streaming Lower Bounds for Approximating CSPs
We consider the approximability of constraint satisfaction problems in t...
research
∙
05/04/2021
Streaming approximation resistance of every ordering CSP
An ordering constraint satisfaction problem (OCSP) is given by a positiv...
research
∙
05/03/2021
Approximability of all finite CSPs in the dynamic streaming setting
A constraint satisfaction problem (CSP), Max-CSP( F), is specified by a ...
research
∙
02/24/2021
Approximability of all Boolean CSPs in the dynamic streaming setting
A Boolean constraint satisfaction problem (CSP), Max-CSP(f), is a maximi...
research
∙
04/24/2020
Optimal Streaming Approximations for all Boolean Max-2CSPs
We prove tight upper and lower bounds on approximation ratios of all Boo...
research
∙
02/16/2020