Author:
Helbig Hansen Keld,Krarup Jakob
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference7 articles.
1. E.W. Dijkstra, “A note on two problems in connexion with graphs”,Numerische Mathematik 1 (1959) 269–271.
2. M.H. van Emden, “Increasing the efficiency of quicksort”, Algorithm 402,Communications of the Association for Computing Machinery 13 (1970) 693–695.
3. K. Helbig Hansen, “Sekvensproblemer med vaegt på modifikation af Held og Karp's algoritme”, M.Sc. thesis, Institute of Datalogy, University of Copenhagen, Denmark (1971).
4. M. Held and R.M. Karp, “The traveling-salesman problem and minimum spanning trees”,Operations Research 18 (1970) 1138–1162.
5. M. Held and R.M. Karp, “The traveling-salesman problem and minimum spanning trees: Part II”,Mathematical Programming 1 (1971) 6–25.
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献