We revisit the a priori TSP (with independent activation) and prove stro...
We devise constant-factor approximation algorithms for finding as many
d...
We develop theoretical foundations and practical algorithms for vehicle
...
We develop new algorithmic techniques for VLSI detailed routing. First, ...
We devise a new approximation algorithm for capacitated vehicle routing....
We revisit the deadline version of the discrete time-cost tradeoff probl...
We devise the first constant-factor approximation algorithm for finding ...
We devise a constant-factor approximation algorithm for the maximization...
We revisit the constant-factor approximation algorithm for the asymmetri...
We present a black-box reduction from the path version of the Traveling
...
We give an improved analysis of the best-of-many Christofides algorithm ...
We show that the classical LP relaxation of the asymmetric traveling sal...
Among various variants of the traveling salesman problem, the s-t-path g...
When delivering items to a set of destinations, one can save time and co...