research
∙
11/09/2022
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP
A long-standing conjecture for the traveling salesman problem (TSP) stat...
share
research
∙
09/30/2022
Proportionally Fair Online Allocation of Public Goods with Predictions
We design online algorithms for the fair allocation of public goods to a...
research
∙
07/21/2022
The Two-Stripe Symmetric Circulant TSP is in P
The symmetric circulant TSP is a special case of the traveling salesman ...
research
∙
06/22/2022
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
We study the two-stage vertex-weighted online bipartite matching problem...
research
∙
09/02/2021
Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows
We study the problem of finding flows in undirected graphs so as to mini...
research
∙
10/30/2020
A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems
Over the last two decades, a significant line of work in theoretical alg...
research
∙
08/08/2020
Online Nash Social Welfare via Promised Utilities
We consider the problem of allocating a set of divisible goods to N agen...
research
∙
07/25/2020
