Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference16 articles.
1. Complexity and Approximation;Ausiello,1999
2. Linear approximation of shortest superstrings;Blum;J. ACM,1994
3. Towards a 4/3 approximation for the asymmetric traveling salesman problem;Carr,2000
4. Worst-case analysis of a new heuristic for the travelling salesman problem;Christofides,1976
5. An analysis of approximations for finding a maximum weight Hamiltonian circuit;Fisher;Oper. Res.,1979
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Three-Bar Charts Packing Problem;Communications in Computer and Information Science;2022
2. A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem;Communications in Computer and Information Science;2021
3. Maximum ATSP with Weights Zero and One via Half-Edges;Theory of Computing Systems;2017-11-04
4. A Parallel TSP-Based Algorithm for Balanced Graph Partitioning;2017 46th International Conference on Parallel Processing (ICPP);2017-08
5. Maximum ATSP with Weights Zero and One via Half-Edges;Approximation and Online Algorithms;2015