research
∙
08/11/2023
A Better-Than-1.6-Approximation for Prize-Collecting TSP
Prize-Collecting TSP is a variant of the traveling salesperson problem w...
share
research
∙
04/16/2023
Thin trees for laminar families
In the laminar-constrained spanning tree problem, the goal is to find a ...
research
∙
12/13/2022
A (Slightly) Improved Deterministic Approximation Algorithm for Metric TSP
We show that the max entropy algorithm can be derandomized (with respect...
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...
research
∙
11/24/2021
Matroid Partition Property and the Secretary Problem
A matroid ℳ on a set E of elements has the α-partition property, for som...
research
∙
05/20/2021
A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP
We show that for some ϵ > 10^-36 and any metric TSP instance, the max en...
research
∙
01/15/2021
An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Problem
We give a randomized 1+√(8ln k/k)-approximation algorithm for the minimu...
research
∙
07/02/2020
A (Slightly) Improved Approximation Algorithm for Metric TSP
For some ϵ > 10^-36 we give a 3/2-ϵ approximation algorithm for metric T...
research
∙
08/01/2019