An approximation algorithm for the generalized assignment problem
- Authors
- David B. ShmoysÉva Tardos
- Journal
- Mathematical Programming
In The Last Decade
doi.org/10.1007/bf01585178 →Countries where authors are citing An approximation algorithm for the generalized assignment problem
This map shows the geographic impact of An approximation algorithm for the generalized assignment problem. 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 An approximation algorithm for the generalized assignment problem with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites An approximation algorithm for the generalized assignment problem more than expected).
Fields of papers citing An approximation algorithm for the generalized assignment problem
This network shows the impact of An approximation algorithm for the generalized assignment problem. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the An approximation algorithm for the generalized assignment problem.
About An approximation algorithm for the generalized assignment problem
This paper, published in 1993, received 437 indexed citations . Written by 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 (343 citations), Industrial and Manufacturing Engineering (153 citations) and Electrical and Electronic Engineering (74 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/bf01585178.