Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.

Bla Csaba, Marek Karpinski, Piotr Krysta

Browse the full SODA paper archive.