Author:
Giannakos A.,Hifi M.,Kheffache R.,Ouafi R.
Subject
General Engineering,General Computer Science
Reference21 articles.
1. Approximation algorithms for multiple terminal, Hamiltonian path problems;Bae;Optimization Letters,2012
2. Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph;Cheriyan;SIAM Journal on Discrete Mathematics,2001
3. Christofides, N. (1976). Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388. Pittsburgh: Graduate School of Industrial Administration. Carnegie-Mellon University; 1976.
4. In pursuit of the traveling salesman, mathematics at the limits of computation;Cook,2012
5. An extension of Christofides’ heuristic to the k-person travelling salesman problem;Frieze;Discrete Applied Mathematics,1983
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献