An improved approximation algorithm for the ATSP with parameterized triangle inequality

Authors:
Tongquan Zhang;Weidong Li;Jianping Li
Affiliations:
Center for Nonlinear Complex Systems, School of Physical Science and Technique, Yunnan University, Kunming 650091, China;Department of Mathematics, School of Mathematics and Statistics, Yunnan University, Kunming 650091, China;Department of Mathematics, School of Mathematics and Statistics, Yunnan University, Kunming 650091, China
Venue:
Journal of Algorithms
Year:
2009

Citing 6
Cited 3

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
The probabilistic relationship between the assignment and asymmetric traveling salesman problems

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Journal of the ACM (JACM)
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality

Journal of Discrete Algorithms
On the relationship between ATSP and the cycle cover problem

Theoretical Computer Science

Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
An improved approximation algorithm for the maximum TSP

Theoretical Computer Science
Deterministic algorithms for multi-criteria TSP

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the asymmetric traveling salesman problem with the @c-parameterized triangle inequality for @c@?[12,1). That means the edge weights in the given complete graph G=(V,E,@w) satisfy @w(u,w)=