On the stability of approximation for Hamiltonian path problems
From MaRDI portal
Recommendations
- SOFSEM 2005: Theory and Practice of Computer Science
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem
- Approximation algorithms for multiple terminal, Hamiltonian path problems
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
Cited in
(12)- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality
- The approximability of the weighted Hamiltonian path completion problem on a tree
- On the approximation ratio of the path matching Christofides algorithm
- The Complexity of Restricted Variants of the Stable Paths Problem
- Structural properties of hard metric TSP inputs (extended abstract)
- scientific article; zbMATH DE number 6850346 (Why is no real title available?)
- On the Hardness of Reoptimization
- SOFSEM 2005: Theory and Practice of Computer Science
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
This page was built for publication: On the stability of approximation for Hamiltonian path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415353)
