research
∙
08/04/2023
Single-Source Unsplittable Flows in Planar Graphs
The single-source unsplittable flow (SSUF) problem asks to send flow fro...
share
research
∙
09/16/2022
A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation
Connectivity augmentation problems are among the most elementary questio...
research
∙
05/02/2022
Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
We develop theoretical foundations and practical algorithms for vehicle ...
research
∙
04/14/2022
Better-Than-4/3-Approximations for Leaf-to-Leaf Tree and Connectivity Augmentation
The Connectivity Augmentation Problem (CAP) together with a well-known s...
research
∙
12/22/2021
Breaching the 2-Approximation Barrier for the Forest Augmentation Problem
The basic goal of survivable network design is to build cheap networks t...
research
∙
07/15/2021
Local Search for Weighted Tree Augmentation and Steiner Tree
We present a technique that allows for improving on some relative greedy...
research
∙
04/14/2021
A Better-Than-2 Approximation for Weighted Tree Augmentation
We present an approximation algorithm for Weighted Tree Augmentation wit...
research
∙
11/30/2020
Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches
We consider the Connectivity Augmentation Problem (CAP), a classical pro...
research
∙
11/10/2020
Improving the Approximation Ratio for Capacitated Vehicle Routing
We devise a new approximation algorithm for capacitated vehicle routing....
research
∙
09/21/2020
Improving on Best-of-Many-Christofides for T-tours
The T-tour problem is a natural generalization of TSP and Path TSP. Give...
research
∙
12/02/2019
An improved approximation algorithm for ATSP
We revisit the constant-factor approximation algorithm for the asymmetri...
research
∙
07/24/2019
Reducing Path TSP to TSP
We present a black-box reduction from the path version of the Traveling ...
research
∙
08/31/2018
An improved upper bound on the integrality ratio for the s-t-path TSP
We give an improved analysis of the best-of-many Christofides algorithm ...
research
∙
08/20/2018
The asymmetric traveling salesman path LP has constant integrality ratio
We show that the classical LP relaxation of the asymmetric traveling sal...
research
∙
04/09/2018