28 citations · 70 across the 20 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2011★ 28 cited
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme
Yair Bartal, Lee-Ad Gottlieb, Robert Krauthgamer
The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+ep…
cs.CC2010★ 4 cited
Matrix sparsification and the sparse null space problem
Lee-Ad Gottlieb, Tyler Neylon
We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the h…