Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
SIAM Journal on Discrete Mathematics
Approximation algorithms for the TSP with sharpened triangle inequality
Information Processing Letters
A new approximation algorithm for the asymmetric TSP with triangle inequality
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximations for ATSP with Parametrized Triangle Inequality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On the relationship between ATSP and the cycle cover problem
Theoretical Computer Science
Minimum-weight cycle covers and their approximability
Discrete Applied Mathematics
An improved approximation algorithm for the ATSP with parameterized triangle inequality
Journal of Algorithms
Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Minimum-weight cycle covers and their approximability
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Deterministic algorithms for multi-criteria TSP
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Approximation algorithms for restricted cycle covers based on cycle decompositions
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
On approximating restricted cycle covers
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
On approximating multicriteria TSP
ACM Transactions on Algorithms (TALG)
Approximation algorithms for multi-criteria traveling salesman problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
We consider the asymmetric traveling salesperson problem with @c-parameterized triangle inequality for @c@?[1/2,1). That means, the edge weights fulfill w(u,v)=