research
∙
06/20/2023
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
We study dynamic (1-ϵ)-approximate rounding of fractional matchings – a ...
share
research
∙
07/15/2022
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
We present dynamic algorithms with polylogarithmic update time for estim...
research
∙
05/18/2022
Improved Online Contention Resolution for Matchings and Applications to the Gig Economy
Motivated by applications in the gig economy, we study approximation alg...
research
∙
07/22/2021
The Stationary Prophet Inequality Problem
We study a continuous and infinite time horizon counterpart to the class...
research
∙
06/18/2021
Beating the Folklore Algorithm for Dynamic Matching
The maximum matching problem in dynamic graphs subject to edge updates (...
research
∙
05/14/2021
The Greedy Algorithm is not Optimal for On-Line Edge Coloring
Nearly three decades ago, Bar-Noy, Motwani and Naor showed that no onlin...
research
∙
04/08/2021
Universally-Optimal Distributed Algorithms for Known Topologies
Many distributed optimization algorithms achieve existentially-optimal r...
research
∙
02/20/2021
Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities
The rich literature on online Bayesian selection problems has long focus...
research
∙
10/30/2020
Online Edge Coloring Algorithms via the Nibble Method
Nearly thirty years ago, Bar-Noy, Motwani and Naor [IPL'92] conjectured ...
research
∙
08/23/2020
Streaming Submodular Matching Meets the Primal-Dual Method
We study streaming submodular maximization subject to matching/b-matchin...
research
∙
12/31/2019
Near-Optimal Schedules for Simultaneous Multicasts
We study the store-and-forward packet routing problem for simultaneous m...
research
∙
11/13/2019
Rounding Dynamic Matchings Against an Adaptive Adversary
We present a new dynamic matching sparsification scheme. From this schem...
research
∙
05/07/2019
Network Coding Gaps for Completion Times of Multiple Unicasts
Arguably the most common network communication problem is multiple-unica...
research
∙
04/19/2019
Stochastic Online Metric Matching
We study the minimum-cost metric perfect matching problem under online i...
research
∙
04/19/2019
Tight Bounds for Online Edge Coloring
Vizing's celebrated theorem asserts that any graph of maximum degree Δ a...
research
∙
04/17/2019
Online Matching with General Arrivals
The online matching problem was introduced by Karp, Vazirani and Vaziran...
research
∙
01/16/2018
Round- and Message-Optimal Distributed Graph Algorithms
Distributed graph algorithms that separately optimize for either the num...
research
∙
01/16/2018
Round- and Message-Optimal Distributed Part-Wise Aggregation
Distributed graph algorithms that separately optimize for either the num...
research
∙
11/17/2017
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms
We present a simple randomized reduction from fully-dynamic integral mat...
research
∙
11/06/2017
