research
∙
10/31/2022
Beating (1-1/e)-Approximation for Weighted Stochastic Matching
In the stochastic weighted matching problem, the goal is to find a large...
share
research
∙
05/29/2022
Generalized Stochastic Matching
In this paper, we generalize the recently studied Stochastic Matching pr...
research
∙
10/13/2021
Online Bipartite Matching with Reusable Resources
We study the classic online bipartite matching problem with a twist: off...
research
∙
06/01/2021
Differentially Private Densest Subgraph
Given a graph, the densest subgraph problem asks for a set of vertices s...
research
∙
07/14/2020
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
Envy-free up to one good (EF1) and envy-free up to any good (EFX) are tw...
research
∙
02/26/2020
Asymmetric Streaming Algorithms for Edit Distance and LCS
The edit distance (ED) and longest common subsequence (LCS) are two fund...
research
∙
02/26/2020
Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS
The edit distance (ED) and longest common subsequence (LCS) are two fund...
research
∙
12/22/2019
Approximate Maximum Matching in Random Streams
In this paper, we study the problem of finding a maximum matching in the...
research
∙
11/09/2018
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs
The k-cut problem asks, given a connected graph G and a positive integer...
research
∙
11/08/2018
Stochastic Matching with Few Queries: New Algorithms and Tools
We consider the following stochastic matching problem on both weighted a...
research
∙
11/04/2018
Lower Bounds for External Memory Integer Sorting via Network Coding
Sorting extremely large datasets is a frequently occuring task in practi...
research
∙
09/30/2017
