David Shmoys

Cited by

	All	Since 2016
Citations	24373	6870
h-index	58	35
i10-index	106	77

1400

700

350

1050

198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202170 97 129 97 159 227 252 341 359 456 534 529 516 602 573 658 754 842 930 916 926 931 899 979 971 1038 1091 1085 1167 1011 1261 1335 1335 752

Public access

View all

9 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Eva TardosProfessor of Computer Science, Cornell UniversityVerified email at cornell.edu
Dorit S. HOCHBAUMUC BerkeleyVerified email at ieor.berkeley.edu
David P. WilliamsonProfessor of Operations Research, Cornell UniversityVerified email at cornell.edu
Retsef LeviProfessor of Operations Management, MITVerified email at mit.edu
Joel WeinVerified email at google.com
Karen AardalVerified email at tudelft.nl
Andreas S. SchulzTechnische Universität MünchenVerified email at tum.de
Paat RusmevichientongProfessor, Marshall School of Business, University of Southern CaliforniaVerified email at marshall.usc.edu
Shane HendersonProfessor of Operations Research and Information Engineering, Cornell UniversityVerified email at cornell.edu
Clifford SteinProfessor of IEOR and CS, Columbia UniversityVerified email at ieor.columbia.edu
Daniel FreundMITVerified email at mit.edu
Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Verified email at alum.mit.edu
Huseyin TopalogluCornell. UniversityVerified email at orie.cornell.edu
Eoin O'MahonyUber TechnologiesVerified email at cornell.edu
Zuo-Jun Max SHENProfessor, UC BerkeleyVerified email at berkeley.edu
Robert KleinbergDepartment of Computer Science, Cornell UniversityVerified email at cs.cornell.edu
Adam N. ElmachtoubColumbia University, Dept. of Industrial Engineering and Operations ResearchVerified email at ieor.columbia.edu
Martin PálGoogle, Inc.Verified email at google.com
Moses CharikarProfessor of Computer Science, Stanford UniversityVerified email at cs.stanford.edu
Sudipto Guha`Verified email at cis.upenn.edu

David Shmoys

Professor of Operations Research & Information Engineering and of Computer Science

Verified email at cs.cornell.edu

Optimization Algorithms Data Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The traveling salesman problem: a guided tour of combinatorial optimization EL Lawler, JK Lenstra, AHG Rinnooy Kan, DB Shmoys WILEY-INTERSCIENCE SERIES IN DISCRETE MATHEMATICS, 1985	4766	1985
Sequencing and scheduling: Algorithms and complexity EL Lawler, JK Lenstra, AHG Rinnooy Kan, DB Shmoys Handbooks in operations research and management science 4, 445-522, 1993	2123	1993
The design of approximation algorithms DP Williamson, DB Shmoys Cambridge university press, 2011	1294	2011
Approximation algorithms for scheduling unrelated parallel machines JK Lenstra, DB Shmoys, É Tardos Mathematical programming 46 (1), 259-271, 1990	1122	1990
A best possible heuristic for the k-center problem DS Hochbaum, DB Shmoys Mathematics of operations research 10 (2), 180-184, 1985	1084	1985
Approximation algorithms for facility location problems DB Shmoys, E Tardos, KI Aardal Proceedings of 29th Annual ACM Symposium on Theory of Computing (STOC) 1997 …, 1997	991	1997
Using dual approximation algorithms for scheduling problems: theoretical and practical results DS Hochbaum, DB Shmoys Journal of the ACM (JACM) 34 (1), 144-162, 1987	859	1987
An approximation algorithm for the generalized assignment problem DB Shmoys, É Tardos Mathematical programming 62 (1), 461-474, 1993	788	1993
A constant-factor approximation algorithm for the k-median problem M Charikar, S Guha, É Tardos, DB Shmoys Journal of Computer and System Sciences 65 (1), 129-149, 2002	764	2002
Fast approximation algorithms for fractional packing and covering problems SA Plotkin, DB Shmoys, É Tardos Mathematics of Operations Research 20 (2), 257-301, 1995	727	1995
Scheduling to minimize average completion time: Off-line and on-line approximation algorithms LA Hall, AS Schulz, DB Shmoys, J Wein Mathematics of operations research 22 (3), 513-544, 1997	548	1997
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach DS Hochbaum, DB Shmoys SIAM journal on computing 17 (3), 539-551, 1988	410	1988
A unified approach to approximation algorithms for bottleneck problems DS Hochbaum, DB Shmoys Journal of the ACM (JACM) 33 (3), 533-550, 1986	406	1986
Scheduling parallel machines on-line DB Shmoys, J Wein, DP Williamson SIAM journal on computing 24 (6), 1313-1331, 1995	381	1995
Dynamic assortment optimization with a multinomial logit choice model and capacity constraint P Rusmevichientong, ZJM Shen, DB Shmoys Operations research 58 (6), 1666-1680, 2010	377	2010
Improved approximation algorithms for the uncapacitated facility location problem FA Chudak, DB Shmoys SIAM Journal on Computing 33 (1), 1-25, 2003	336	2003
Improved approximation algorithms for network design problems MX Goemans, AV Goldberg, SA Plotkin, DB Shmoys, E Tardos, ... Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, 223, 1994	292	1994
Short shop schedules DP Williamson, LA Hall, JA Hoogeveen, CAJ Hurkens, JK Lenstra, ... Operations Research 45 (2), 288-294, 1997	283	1997
Improved approximation algorithms for shop scheduling problems DB Shmoys, C Stein, J Wein SIAM Journal on Computing 23 (3), 617-632, 1994	264	1994
Well-solved special cases PC Gilmore, EL Lawler, DB Shmoys The traveling salesman problem, 87-143, 1985	264*	1985

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors