Nathan Klein
Scholar

Nathan Klein

Google Scholar ID: S0PEMt4AAAAJ
Boston University
Approximation algorithms
Citations & Impact
All-time
Citations
402
 
H-index
9
 
i10-index
8
 
Publications
20
 
Co-authors
0
 
Publications
5 items
A Lower Bound for the Max Entropy Algorithm for TSP
Conference on Integer Programming and Combinatorial Optimization · 2023
Cited
1
A Better-Than-1.6-Approximation for Prize-Collecting TSP
Conference on Integer Programming and Combinatorial Optimization · 2023
Cited
3
Resume (English only)
Academic Achievements
  • Published multiple papers on topics such as DAG edge deletion, half-integral TSP, k-edge-connectivity, lower bounds for TSP, and prize-collecting TSP, presented at top conferences like APPROX, STOC, and ICALP.
Research Experience
  • Postdoc in the School of Mathematics at the Institute for Advanced Study; advises students including Zhuan Khye Koh, Pooria Jalali Farahani, and Logan Grout.
Education
  • PhD from the University of Washington, advised by Anna Karlin and Shayan Oveis Gharan.
Background
  • Assistant Professor at Boston University, with a focus on approximation algorithms, particularly graph problems like the TSP, and techniques to round solutions to linear programs.
Miscellany
  • Teaches courses including Advanced Algorithms, Probability in Computing, and Rounding Techniques in Approximation Algorithms.
Co-authors
0 total
Co-authors: 0 (list not available)