research
∙
09/21/2022
Improved Approximation for Two-Edge-Connectivity
The basic goal of survivable network design is to construct low-cost net...
share
research
∙
09/12/2022
Unsplittable Euclidean Capacitated Vehicle Routing: A (2+ε)-Approximation Algorithm
In the unsplittable capacitated vehicle routing problem, we are given a ...
research
∙
08/19/2021
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds
In their breakthrough ICALP'15 paper, Bernstein and Stein presented an a...
research
∙
07/17/2020
All-Pairs LCA in DAGs: Breaking through the O(n^2.5) barrier
Let G=(V,E) be an n-vertex directed acyclic graph (DAG). A lowest common...
research
∙
06/26/2019
