N. Klein

activity

20192023

most citedA Better-Than-1.6-Approximation for Prize-Collecting TSP

3 citations · 5 across the 7 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

cs.DS2021

Matroid Partition Property and the Secretary Problem

Dorna Abdolazimi, Anna R. Karlin, Nathan Klein +1

A matroid $M$ on a set $E$ of elements has the $α$ -partition property, for some $α > 0$ , if it is possible to (randomly) construct a partition matroid $P$ on (a s…

cs.DS2021

A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP

Anna Karlin, Nathan Klein, Shayan Oveis Gharan

We show that for some $ε > 1 0^{- 36}$ and any metric TSP instance, the max entropy algorithm returns a solution of expected cost at most $\frac{3}{2} - ε$ times the cost of the optimal…

cs.DS2021★ 1 cited

An Improved Approximation Algorithm for the Minimum $k$ -Edge Connected Multi-Subgraph Problem

Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan +1

We give a randomized $1 + \frac{5.06}{k}$ -approximation algorithm for the minimum $k$ -edge connected spanning multi-subgraph problem, $k$ -ECSM.

Matroid Partition Property and the Secretary Problem

A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP

An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Problem

An Improved Approximation Algorithm for the Minimum $k$ -Edge Connected Multi-Subgraph Problem