Approximation algorithms for scheduling unrelated parallel machines
- Journal
- Mathematical Programming
In The Last Decade
doi.org/10.1007/bf01585745 →Countries where authors are citing Approximation algorithms for scheduling unrelated parallel machines
This map shows the geographic impact of Approximation algorithms for scheduling unrelated parallel machines. 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 Approximation algorithms for scheduling unrelated parallel machines with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Approximation algorithms for scheduling unrelated parallel machines more than expected).
Fields of papers citing Approximation algorithms for scheduling unrelated parallel machines
This network shows the impact of Approximation algorithms for scheduling unrelated parallel machines. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the Approximation algorithms for scheduling unrelated parallel machines.
About Approximation algorithms for scheduling unrelated parallel machines
This paper, published in 1990, received 543 indexed citations . Written by Jan Karel Lenstra, David B. Shmoys and Éva Tardos covering the research area of Industrial and Manufacturing Engineering and Computer Networks and Communications. It is primarily cited by scholars working on Computer Networks and Communications (384 citations), Industrial and Manufacturing Engineering (311 citations) and Computational Theory and Mathematics (117 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/bf01585745.