David Shmoys
David Shmoys
Professor of Operations Research & Information Engineering and of Computer Science
Verified email at cs.cornell.edu
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
46501985
Sequencing and scheduling: Algorithms and complexity
EL Lawler, JK Lenstra, AHGR Kan, DB Shmoys
Handbooks in operations research and management science 4, 445-522, 1993
20221993
The design of approximation algorithms
DP Williamson, DB Shmoys
Cambridge university press, 2011
11272011
Approximation algorithms for scheduling unrelated parallel machines
JK Lenstra, DB Shmoys, Tardos
Mathematical programming 46 (1-3), 259-271, 1990
10411990
A best possible heuristic for the k-center problem
DS Hochbaum, DB Shmoys
Mathematics of operations research 10 (2), 180-184, 1985
10091985
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
9361997
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
8171987
An approximation algorithm for the generalized assignment problem
DB Shmoys, Tardos
Mathematical programming 62 (1-3), 461-474, 1993
7431993
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
6992002
Fast approximation algorithms for fractional packing and covering problems
SA Plotkin, DB Shmoys, Tardos
Mathematics of Operations Research 20 (2), 257-301, 1995
6941995
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
5241997
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
3891988
A unified approach to approximation algorithms for bottleneck problems
DS Hochbaum, DB Shmoys
Journal of the ACM (JACM) 33 (3), 533-550, 1986
3701986
Scheduling parallel machines on-line
DB Shmoys, J Wein, DP Williamson
SIAM journal on computing 24 (6), 1313-1331, 1995
3691995
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
3212010
Improved approximation algorithms for the uncapacitated facility location problem
FA Chudak, DB Shmoys
SIAM Journal on Computing 33 (1), 1-25, 2003
3122003
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
2911994
Short shop schedules
DP Williamson, LA Hall, JA Hoogeveen, CAJ Hurkens, JK Lenstra, ...
Operations Research 45 (2), 288-294, 1997
2681997
Well-solved special cases
PC Gilmore, EL Lawler, DB Shmoys
The traveling salesman problem, 87-143, 1985
253*1985
Improved approximation algorithms for shop scheduling problems
DB Shmoys, C Stein, J Wein
SIAM Journal on Computing 23 (3), 617-632, 1994
2411994
The system can't perform the operation now. Try again later.
Articles 1–20