LP-Based Approximation Algorithms for Traveling Salesman Path Problems

Abstract

This paper has been merged into 1110.4604.

arXiv commentThis paper has been merged into 1110.4604

References in corpus (1)

• Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem

Cited by in corpus (1)

• An LP-based 3/2-approximation algorithm for the graphic s-t path TSP