The traveling-salesman problem and minimum spanning trees: Part II
- Authors
- Michael HeldRichard M. Karp
- Journal
- Mathematical Programming
In The Last Decade
doi.org/10.1007/bf01584070 →Countries where authors are citing The traveling-salesman problem and minimum spanning trees: Part II
This map shows the geographic impact of The traveling-salesman problem and minimum spanning trees: Part II. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by The traveling-salesman problem and minimum spanning trees: Part II with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites The traveling-salesman problem and minimum spanning trees: Part II more than expected).
Fields of papers citing The traveling-salesman problem and minimum spanning trees: Part II
This network shows the impact of The traveling-salesman problem and minimum spanning trees: Part II. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the The traveling-salesman problem and minimum spanning trees: Part II.
About The traveling-salesman problem and minimum spanning trees: Part II
This paper, published in 1971, received 639 indexed citations . Written by Michael Held and Richard M. Karp covering the research area of Industrial and Manufacturing Engineering and Signal Processing. It is primarily cited by scholars working on Industrial and Manufacturing Engineering (415 citations), Computer Networks and Communications (162 citations) and Computational Theory and Mathematics (134 citations). Published in Mathematical Programming.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.
This paper is also available at doi.org/10.1007/bf01584070.