Corpus ID: 6669787

On Approximation Lower Bounds for TSP with Bounded Metrics

@article{Karpinski2012OnAL,
  title={On Approximation Lower Bounds for TSP with Bounded Metrics},
  author={M. Karpinski and R. Schmied},
  journal={Electron. Colloquium Comput. Complex.},
  year={2012},
  volume={19},
  pages={8}
}
  • M. Karpinski, R. Schmied
  • Published 2012
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the best known bounds for unbounded metric TSP problems. In particular, we prove the best known lower bound for TSP with bounded metrics for the metric bound equal to 4. 
    18 Citations
    Approximation Taxonomy of Metric TSP ( Update : April 2015 )
    • Highly Influenced
    • PDF
    Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies
    • 1
    • PDF
    Approximation hardness of graphic TSP on cubic graphs
    • 12
    • PDF
    Improved integrality gap upper bounds for TSP with distances one and two
    • 3
    • PDF
    Improved Inapproximability for TSP
    • M. Lampis
    • Computer Science, Mathematics
    • APPROX-RANDOM
    • 2012
    • 19
    • PDF

    References

    SHOWING 1-10 OF 29 REFERENCES
    Improved lower bounds on the approximability of the Traveling Salesman Problem
    • 37
    • PDF
    The Traveling Salesman Problem with Distances One and Two
    • 419
    8/7-approximation algorithm for (1,2)-TSP
    • 106
    • PDF
    Improved Lower Bounds for the Shortest Superstring and Related Problems
    • 6
    • PDF
    TSP with bounded metrics
    • 32
    • PDF
    On Some Tighter Inapproximability Results
    • 260
    An Explicit Lower Bound for TSP with Distances One and Two
    • 31
    Improved Inapproximability for TSP
    • M. Lampis
    • Computer Science, Mathematics
    • APPROX-RANDOM
    • 2012
    • 19
    • Highly Influential
    • PDF
    Some optimal inapproximability results
    • 1,691
    • PDF