42 citations · 202 across the 21 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 1 cited
Constant Factor Approximation for ATSP with Two Edge Weights
Ola Svensson, Jakub Tarnawski, László A. Végh
We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the…
cs.DS2015★ 39 cited
Fast Generation of Random Spanning Trees and the Effective Resistance Metric
Aleksander Madry, Damian Straszak, Jakub Tarnawski
We present a new algorithm for generating a uniformly random spanning tree in an undirected graph. Our algorithm samples such a tree in expected time. This imp…