Nathan Klein

Available identifiers

zbMath Open klein.nathanMaRDI QIDQ5144893

List of research outcomes

Publication	Date of Publication	Type
Matroid partition property and the secretary problem	2024-09-25	Paper
An improved approximation algorithm for the minimum k -edge connected multi-subgraph problem	2023-12-08	Paper
From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP	2023-11-15	Paper
A (slightly) improved approximation algorithm for metric TSP	2023-11-14	Paper
A deterministic better-than-3/2 approximation algorithm for metric TSP	2023-11-09	Paper
A 4/3-approximation algorithm for half-integral cycle cut instances of the TSP	2023-11-09	Paper
A Lower Bound for the Max Entropy Algorithm for TSP	2023-11-03	Paper
Matroid Partition Property and the Secretary Problem	2021-11-24	Paper
A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP	2021-05-20	Paper
An improved approximation algorithm for TSP in the half integral case	2021-01-19	Paper
An Improved Approximation Algorithm for TSP in the Half Integral Case	2019-08-01	Paper
Ghost Value Augmentation for $k$-Edge-Connectivity	N/A	Paper

Research outcomes over time

This page was built for person: Nathan Klein