Posts Tagged ‘Short’
Mark Velednitsky Finds Short Proof For Traveling Salesman Problem
IEOR graduate student Mark Velednitsky has reduced a twenty-eight page proof for the traveling salesman problem (TSP) to just a few lines. Velednitsky’s proof titled “Short combinatorial proof that the…
Read More