An improved approximation algorithm for the ATSP with parameterized triangle inequality
Explore this paper's citation graph
Summary
An approximation algorithm is devised which is better than both [email protected]@[email-protected]^3 and @[email protected] for almost all @[ email protected)?[12,1).
- Type
- article
- Published
- 2009-04-01
- Cited by
- 10
- References
- 11
- OpenAlex
- https://openalex.org/W2035448415
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:17440186
Keywords
Triangle inequality, Combinatorics, Parameterized complexity, Travelling salesman problem, Mathematics
References
- The probabilistic relationship between the assignment and asymmetric traveling salesman problems
- Network Flows: Theory, Algorithms, and Applications
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- On the relationship between ATSP and the cycle cover problem
- A new approximation algorithm for the asymmetric TSP with triangle inequality
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization
- THE TRAVELING SALESMAN PROBLEM : A GUIDED TOUR OF COMBINATORIAL OPTIMIZATION
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- The probabilistic relationship between the assignment and asymmetric traveling salesman problems
- An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality
Cited by
- Harmonogramowanie przedsięwzięć wieloobiektowych z ciągłą realizacją procesów na działkach roboczych
- The Maximum Hamilton Path Problem with Parameterized Triangle Inequality
- An improved approximation algorithm for the maximum TSP
- Deterministic algorithms for multi-criteria Max-TSP
- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
- Deterministic Algorithms for Multi-criteria TSP
- Minimizing the Duration of Repetitive Construction Processes with Work Continuity Constraints
- From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization
- Approximating the asymmetric p-center problem in parameterized complete digraphs
Related papers
- A SOLUTION METHOD FOR THE TRAVELING SALESMAN N PERSON M TOWN PROBLEM (TSP(N/M)) USING THE GENETIC ALGORITHM
- An Approximation Algorithm for the Maximum Traveling Salesman Problem
- Design of a Decision Support System for Performance Appraisal of Civil Servants with a Fuzzy Multi Attribute Decision Making Model
- On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems
- Approximation algorithms for the TSP with sharpened triangle inequality
- On Approximating Multi-Criteria TSP