David B. Shmoys

163 papers A* 36A 3B 17C 1Misc 1Journal 84Unranked 18

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Cornell University Uses Integer Programming to Optimize Final Exam Scheduling. INFORMS J. Appl. Anal. Tinghan Ye, Adam S. Jovine, Willem van Osselaer, Qihan Zhu, David B. Shmoys
2026	A*	`conf`	Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General. SODA David B. Shmoys, Varun Suriyanarayana, Seeun William Umboh
2026	J	`jnl`	Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General. CoRR David B. Shmoys, Varun Suriyanarayana, Seeun William Umboh
2025	J	`jnl`	LISTEN to Your Preferences: An LLM Framework for Multi-Objective Selection. CoRR Adam S. Jovine, Tinghan Ye, Francis Bahk, Jingjing Wang, David B. Shmoys, Peter I. Frazier
2025	—	`conf`	Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search. ACDA Daniel Brous, David B. Shmoys
2025	J	`jnl`	Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search. CoRR Daniel Brous, David B. Shmoys
2025	—	`conf`	Reducing Income Variability in Natural Resource Portfolios via Integer Programming. CPAIOR (2) Laura Greenstreet, Qinru Shi, Marc Grimson, Franz W. Simon, Suresh Andrew Sethi, Carla P. Gomes, Andrea Lodi, David B. Shmoys
2024	—	`conf`	A Data-Driven Model for LoRaWAN Connection Quality and Coverage. WF-IoT Rodriguez Alfredo, Sander Aarts, Ali Amadeh, Jacob Dentes, Alex Coy, Kenneth Schlather, David B. Shmoys, K. Max Zhang
2024	B	`conf`	Bounding the Price-of-Fair-Sharing Using Knapsack-Cover Constraints to Guide Near-Optimal Cost-Recovery Algorithms. WAOA Sander Aarts, Jacob Dentes, Manxi Wu, David B. Shmoys
2024	Misc	`conf`	Harmony: A Congestion-free Datacenter Architecture. NSDI Saksham Agarwal, Qizhe Cai, Rachit Agarwal, David B. Shmoys, Amin Vahdat
2024	A*	`conf`	Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints. SODA Varun Suriyanarayana, Varun Sivashankar, Siddharth Gollapudi, David B. Shmoys
2024	J	`jnl`	Modeling the Risk of In-Person Instruction During the COVID-19 Pandemic. INFORMS J. Appl. Anal. Brian Liu, Yujia Zhang, Shane G. Henderson, David B. Shmoys, Peter I. Frazier
2024	B	`conf`	Network Flow Problems with Electric Vehicles. IPCO Haripriya Pulyassary, Kostas Kollias, Aaron Schild, David B. Shmoys, Manxi Wu
2024	B	`conf`	Small Additive Error for Unsplittable Multicommodity Flow in Outerplanar Graphs. WAOA Richard Shapley, David B. Shmoys
2023	J	`jnl`	A min-max theorem for the minimum fleet-size problem. Oper. Res. Lett. Tinghan Ye, David B. Shmoys
2023	J	`jnl`	An Interpretable Determinantal Choice Model for Subset Selection. CoRR Sander Aarts, David B. Shmoys, Alex Coy
2023	J	`jnl`	Erratum to "Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems". Math. Oper. Res. Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson
2023	—	`conf`	GILP: An Interactive Tool for Visualizing the Simplex Algorithm. SIGCSE (1) Henry W. Robbins, Samuel C. Gutekunst, David B. Shmoys, David P. Williamson
2023	B	`conf`	Hitting Sets when the Shallow Cell Complexity is Small. WAOA Sander Aarts, David B. Shmoys
2023	J	`jnl`	Hitting Sets when the Shallow Cell Complexity is Small. CoRR Sander Aarts, David B. Shmoys
2023	J	`jnl`	Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints. CoRR Varun Suriyanarayana, Varun Sivashankar, Siddharth Gollapudi, David B. Shmoys
2023	J	`jnl`	Network Flow Problems with Electric Vehicles. CoRR Haripriya Pulyassary, Kostas Kollias, Aaron Schild, David B. Shmoys, Manxi Wu
2023	—	`ed.`	SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023, Seattle, WA, USA, May 31 - June 2, 2023 ACDA Jonathan W. Berry, David B. Shmoys, Lenore Cowen, Uwe Naumann
2023	J	`jnl`	SPT optimality (mostly) via linear programming. Oper. Res. Lett. Woo-Hyung Cho, David B. Shmoys, Shane G. Henderson
2023	J	`jnl`	Scheduling (Dagstuhl Seminar 23061). Dagstuhl Reports Nicole Megow, Benjamin Moseley, David B. Shmoys, Ola Svensson, Sergei Vassilvitskii, Jens Schlöter
2023	J	`jnl`	Sharing the Cost of IoT Wireless Coverage with a Strengthened Linear Programming Formulation. CoRR Sander Aarts, Manxi Wu, David B. Shmoys
2022	J	`jnl`	A min-max theorem for the minimum fleet-size problem. CoRR Tinghan Ye, David B. Shmoys
2022	A*	`conf`	Combatting Gerrymandering with Social Choice: The Design of Multi-member Districts. EC Nikhil Garg, Wes Gurnee, David Rothschild, David B. Shmoys
2022	A*	`conf`	From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good. PODC Rachit Agarwal, Shijin Rajakrishnan, David B. Shmoys
2022	J	`jnl`	GILP: An Interactive Tool for Visualizing the Simplex Algorithm. CoRR Henry W. Robbins, Samuel C. Gutekunst, Frans Schalekamp, David B. Shmoys, David P. Williamson
2022	J	`jnl`	Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. Oper. Res. Daniel Freund, Shane G. Henderson, David B. Shmoys
2022	B	`conf`	Scheduling Appointments Online: The Power of Deferred Decision-Making. WAOA Devin Smedira, David B. Shmoys
2022	J	`jnl`	Scheduling with Predictions. CoRR Woo-Hyung Cho, Shane G. Henderson, David B. Shmoys
2021	J	`jnl`	Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. ACM Trans. Algorithms Hyung-Chan An, Robert Kleinberg, David B. Shmoys
2021	J	`jnl`	Combatting Gerrymandering with Social Choice: the Design of Multi-member Districts. CoRR Nikhil Garg, Wes Gurnee, David Rothschild, David B. Shmoys
2021	—	`conf`	Fairmandering: A column generation heuristic for fairness-optimized political districting. ACDA Wes Gurnee, David B. Shmoys
2021	J	`jnl`	Fairmandering: A column generation heuristic for fairness-optimized political districting. CoRR Wes Gurnee, David B. Shmoys
2021	B	`conf`	On the Power of Static Assignment Policies for Robust Facility Location Problems. IPCO Omar El Housni, Vineet Goyal, David B. Shmoys
2021	J	`jnl`	Scheduling Appointments Online: The Power of Deferred Decision-Making. CoRR Devin Smedira, David B. Shmoys
2020	J	`jnl`	Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. CoRR Hyung-Chan An, Robert Kleinberg, David B. Shmoys
2020	J	`jnl`	Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems. Math. Oper. Res. Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson
2020	J	`jnl`	Elements of Scheduling. CoRR Jan Karel Lenstra, David B. Shmoys
2020	J	`jnl`	Scheduling (Dagstuhl Seminar 20081). Dagstuhl Reports Nicole Megow, David B. Shmoys, Ola Svensson
2019	J	`jnl`	Analytics and Bikes: Riding Tandem with Motivate to Improve Mobility. INFORMS J. Appl. Anal. Daniel Freund, Shane G. Henderson, Eoin O'Mahony, David B. Shmoys
2019	J	`jnl`	Computational sustainability: computing for a better world and a sustainable future. Commun. ACM Carla P. Gomes, Thomas G. Dietterich, Christopher Barrett, Jon Conrad, Bistra Dilkina, Stefano Ermon, Fei Fang, Andrew Farnsworth, Alan Fern, Xiaoli Z. Fern, Daniel Fink, Douglas H. Fisher, Alexander Flecker, Daniel Freund, Angela Fuller, John M. Gregoire, John E. Hopcroft, Steve Kelling, J. Zico Kolter, Warren B. Powell, Nicole D. Sintov, John S. Selker, Bart Selman, Daniel Sheldon, David B. Shmoys, Milind Tambe, Weng-Keen Wong, Christopher Wood, Xiaojian Wu, Yexiang Xue, Amulya Yadav, Abdul-Aziz Yakubu, Mary Lou Zeeman
2018	C	`conf`	Bike Angels: An Analysis of Citi Bike's Incentive Program. COMPASS Hangil Chung, Daniel Freund, David B. Shmoys
2018	A*	`conf`	Sincronia: near-optimal network design for coflows. SIGCOMM Saksham Agarwal, Shijin Rajakrishnan, Akshay Narayan, Rachit Agarwal, David B. Shmoys, Amin Vahdat
2017	B	`conf`	A Bicriteria Approximation Algorithm for the k-Center and k-Median Problems. WAOA Soroush Alamdari, David B. Shmoys
2017	J	`jnl`	A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. SIAM J. Discret. Math. Maurice Cheung, Julián Mestre, David B. Shmoys, José Verschae
2017	B	`conf`	Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. IPCO Daniel Freund, Shane G. Henderson, David B. Shmoys
2017	A	`conf`	Prize-Collecting TSP with a Budget Constraint. ESA Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson
2016	J	`jnl`	A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. CoRR Maurice Cheung, Julián Mestre, David B. Shmoys, José Verschae
2016	J	`jnl`	Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. CoRR Daniel Freund, Shane G. Henderson, David B. Shmoys
2016	J	`jnl`	The submodular joint replenishment problem. Math. Program. Maurice Cheung, Adam N. Elmachtoub, Retsef Levi, David B. Shmoys
2015	J	`jnl`	Approximation Algorithms for Fragmenting a Graph Against a Stochastically-Located Threat. Theory Comput. Syst. David B. Shmoys, Gwen Spencer
2015	A*	`conf`	Data Analysis and Optimization for (Citi)Bike Sharing. AAAI Eoin O'Mahony, David B. Shmoys
2015	J	`jnl`	Improving Christofides' Algorithm for the s-t Path TSP. J. ACM Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys
2015	—	`conf`	Predicting Bike Usage for New York City's Bike Sharing System. AAAI Workshop: Computational Sustainability Divya Singhvi, Somya Singhvi, Peter I. Frazier, Shane G. Henderson, Eoin O'Mahony, David B. Shmoys, Dawn B. Woodard
2015	J	`jnl`	Primal-dual schema for capacitated covering problems. Math. Program. Tim Carnes, David B. Shmoys
2014	A*	`ed.`	Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014 STOC David B. Shmoys
2013	J	`jnl`	Mathematical Programming Guides Air-Ambulance Routing at Ornge. Interfaces Timothy A. Carnes, Shane G. Henderson, David B. Shmoys, Mahvareh Ahghari, Russell D. MacDonald
2012	A*	`conf`	Improving christofides' algorithm for the s-t path TSP. STOC Hyung-Chan An, Robert Kleinberg, David B. Shmoys
2012	J	`jnl`	LP-based approximation algorithms for capacitated facility location. Math. Program. Retsef Levi, David B. Shmoys, Chaitanya Swamy
2012	J	`jnl`	Maximizing the Spread of Cascades Using Network Design CoRR Daniel Sheldon, Bistra Dilkina, Adam N. Elmachtoub, Ryan Finseth, Ashish Sabharwal, Jon Conrad, Carla P. Gomes, David B. Shmoys, William Allen, Ole Amundsen, William Vaughan
2012	J	`jnl`	Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization. SIAM J. Comput. Chaitanya Swamy, David B. Shmoys
2011	—	`conf`	A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. APPROX-RANDOM Maurice Cheung, David B. Shmoys
2011	B	`conf`	Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat. WAOA David B. Shmoys, Gwen Spencer
2011	J	`jnl`	Approximation algorithms for supply chain planning and logistics problems with market choice. Math. Program. Joseph Geunes, Retsef Levi, H. Edwin Romeijn, David B. Shmoys
2011	J	`jnl`	Improving Christofides' Algorithm for the s-t Path TSP CoRR Hyung-Chan An, Robert Kleinberg, David B. Shmoys
2011	J	`jnl`	LP-Based Approximation Algorithms for Traveling Salesman Path Problems CoRR Hyung-Chan An, David B. Shmoys
2011	—	`conf`	Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem. APPROX-RANDOM Tim Carnes, David B. Shmoys
2011	—	`book`	The Design of Approximation Algorithms. David P. Williamson, David B. Shmoys
2010	—	`conf`	Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. APPROX-RANDOM Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys
2010	J	`jnl`	Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint. Oper. Res. Paat Rusmevichientong, Zuo-Jun Max Shen, David B. Shmoys
2010	—	`conf`	Improved Lower Bounds for the Universal and APPROX-RANDOM Igor Gorodezky, Robert D. Kleinberg, David B. Shmoys, Gwen Spencer
2010	A	`conf`	Maximizing the Spread of Cascades Using Network Design. UAI Daniel Sheldon, Bistra Dilkina, Adam N. Elmachtoub, Ryan Finseth, Ashish Sabharwal, Jon Conrad, Carla P. Gomes, David B. Shmoys, William Allen, Ole Amundsen, William Vaughan
2009	J	`jnl`	A PTAS for capacitated sum-of-ratios optimization. Oper. Res. Lett. Paat Rusmevichientong, Zuo-Jun Max Shen, David B. Shmoys
2008	J	`jnl`	A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem. Manag. Sci. Retsef Levi, Robin Roundy, David B. Shmoys, Maxim Sviridenko
2008	B	`conf`	A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem. IPCO David B. Shmoys, Kunal Talwar
2008	J	`jnl`	Algorithms for the universal and a priori TSP. Oper. Res. Lett. Frans Schalekamp, David B. Shmoys
2008	J	`jnl`	Approximation Algorithms for Capacitated Stochastic Inventory Control Models. Oper. Res. Retsef Levi, Robin Roundy, David B. Shmoys, Van-Anh Truong
2008	J	`jnl`	Fault-tolerant facility location. ACM Trans. Algorithms Chaitanya Swamy, David B. Shmoys
2008	B	`conf`	Primal-Dual Schema for Capacitated Covering Problems. IPCO Tim Carnes, David B. Shmoys
2007	B	`conf`	Approximation Algorithms for 2-Stage Stochastic Scheduling Problems. IPCO David B. Shmoys, Mauro Sozio
2007	J	`jnl`	Approximation Algorithms for Stochastic Inventory Control Models. Math. Oper. Res. Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys
2007	J	`jnl`	Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models. Math. Oper. Res. Retsef Levi, Robin Roundy, David B. Shmoys
2007	—	`conf`	Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization. Probabilistic Methods in the Design and Analysis of Algorithms Chaitanya Swamy, David B. Shmoys
2006	J	`jnl`	An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM David B. Shmoys, Chaitanya Swamy
2006	—	`conf`	Approximation Algorithms for 2-Stage Stochastic Optimization Problems. FSTTCS Chaitanya Swamy, David B. Shmoys
2006	J	`jnl`	Approximation algorithms for 2-stage stochastic optimization problems. SIGACT News Chaitanya Swamy, David B. Shmoys
2006	J	`jnl`	Primal-Dual Algorithms for Deterministic Inventory Problems. Math. Oper. Res. Retsef Levi, Robin Roundy, David B. Shmoys
2006	A*	`conf`	Provably near-optimal sampling-based algorithms for Stochastic inventory control models. STOC Retsef Levi, Robin Roundy, David B. Shmoys
2005	A*	`conf`	A constant approximation algorithm for the one-warehouse multi-retailer problem. SODA Retsef Levi, Robin Roundy, David B. Shmoys
2005	—	`conf`	Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization. Algorithms for Optimization with Incomplete Information Chaitanya Swamy, David B. Shmoys
2005	B	`conf`	Approximation Algorithms for Stochastic Inventory Control Models. IPCO Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys
2005	B	`conf`	Inventory and Facility Location Models with Market Selection. IPCO Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys
2005	A*	`conf`	Sampling-based Approximation Algorithms for Multi-stage Stochastic. FOCS Chaitanya Swamy, David B. Shmoys
2005	J	`jnl`	The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners. Manuf. Serv. Oper. Manag. Retsef Levi, Martin Pál, Robin O. Roundy, David B. Shmoys, Ravi Subramanian, Xinxin Hu, Gad Allon, Felipe Caro, Holly S. Lutze
2004	J	`jnl`	An improved approximation algorithm for the partial Latin square extension problem. Oper. Res. Lett. Carla P. Gomes, Rommel G. Regis, David B. Shmoys
2004	J	`jnl`	Approximations and Randomization to Boost CSP Techniques. Ann. Oper. Res. Carla P. Gomes, David B. Shmoys
2004	A*	`conf`	Facility location with Service Installation Costs. SODA David B. Shmoys, Chaitanya Swamy, Retsef Levi
2004	J	`jnl`	Foreword. J. Algorithms David B. Shmoys
2004	B	`conf`	LP-based Approximation Algorithms for Capacitated Facility Location. IPCO Retsef Levi, David B. Shmoys, Chaitanya Swamy
2004	A*	`conf`	Primal-dual algorithms for deterministic inventory problems. STOC Retsef Levi, Robin Roundy, David B. Shmoys
2004	A*	`conf`	Stochastic Optimization is (Almost) as easy as Deterministic Optimization. FOCS David B. Shmoys, Chaitanya Swamy
2003	A*	`conf`	An improved approximation algorithm for the partial latin square extension problem. SODA Carla P. Gomes, Rommel G. Regis, David B. Shmoys
2003	A*	`conf`	Fault-tolerant facility location. SODA Chaitanya Swamy, David B. Shmoys
2003	J	`jnl`	Improved Approximation Algorithms for the Uncapacitated Facility Location Problem. SIAM J. Comput. Fabián A. Chudak, David B. Shmoys
2003	A	`conf`	Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties. ESA Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys
2002	J	`jnl`	A Constant-Factor Approximation Algorithm for the k-Median Problem. J. Comput. Syst. Sci. Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
2000	—	`conf`	Approximation algorithms for facility location problems. APPROX David B. Shmoys
2000	A*	`ed.`	Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA. SODA David B. Shmoys
1999	J	`jnl`	A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. Inf. Process. Lett. Karen I. Aardal, Fabián A. Chudak, David B. Shmoys
1999	A*	`conf`	A Constant-Factor Approximation Algorithm for the STOC Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
1999	A*	`conf`	Approximation Algorithms for Clustering Problems. COLT David B. Shmoys
1999	J	`jnl`	Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds. J. Algorithms Fabián A. Chudak, David B. Shmoys
1999	A*	`conf`	Improved Approximation Algorithms for a Capacitated Facility Location Problem. SODA Fabián A. Chudak, David B. Shmoys
1998	J	`jnl`	Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. J. Comb. Optim. Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein
1998	—	`conf`	Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems. APPROX David B. Shmoys
1997	A*	`conf`	Approximation Algorithms for Facility Location Problems (Extended Abstract). STOC David B. Shmoys, Éva Tardos, Karen I. Aardal
1997	A*	`conf`	Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract). SODA Fabián A. Chudak, David B. Shmoys
1997	J	`jnl`	Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms. Math. Oper. Res. Leslie A. Hall, Andreas S. Schulz, David B. Shmoys, Joel Wein
1997	J	`jnl`	Short Shop Schedules. Oper. Res. David P. Williamson, Leslie A. Hall, J. A. Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey Vasil'evich Sevast'janov, David B. Shmoys
1997	J	`jnl`	Strategic directions in research in theory of computing. SIGACT News Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys
1996	B	`conf`	A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. IPCO Paul Martin, David B. Shmoys
1996	A*	`conf`	Improved Scheduling Algorithms for Minsum Criteria. ICALP Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein
1996	A*	`conf`	Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms. SODA Leslie A. Hall, David B. Shmoys, Joel Wein
1995	J	`jnl`	Fast Approximation Algorithms for Fractional Packing and Covering Problems. Math. Oper. Res. Serge A. Plotkin, David B. Shmoys, Éva Tardos
1995	J	`jnl`	Scheduling Parallel Machines On-Line. SIAM J. Comput. David B. Shmoys, Joel Wein, David P. Williamson
1994	A*	`conf`	Improved Approximation Algorithms for Network Design Problems. SODA Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson
1994	J	`jnl`	Improved Approximation Algorithms for Shop Scheduling Problems. SIAM J. Comput. David B. Shmoys, Clifford Stein, Joel Wein
1993	J	`jnl`	An approximation algorithm for the generalized assignment problem. Math. Program. David B. Shmoys, Éva Tardos
1993	—	`ch.`	Chapter 9 Sequencing and scheduling: Algorithms and complexity. Logistics of Production and Inventory Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys
1993	—	`conf`	Computing near-optimal solutions to combinatorial optimization problems. Combinatorial Optimization David B. Shmoys
1993	A*	`conf`	Scheduling Unrelated Machines with Costs. SODA David B. Shmoys, Éva Tardos
1992	J	`jnl`	Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better. Math. Oper. Res. Leslie A. Hall, David B. Shmoys
1992	J	`jnl`	Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems. SIAM J. Comput. Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
1991	A*	`conf`	Fast Approximation Algorithms for Fractional Packing and Covering Problems FOCS Serge A. Plotkin, David B. Shmoys, Éva Tardos
1991	A*	`conf`	Improved Approximation Algorithms for Shop Scheduling Problems. SODA David B. Shmoys, Clifford Stein, Joel Wein
1991	J	`jnl`	Permutation vs. non-permutation flow shop schedules. Oper. Res. Lett. Chris N. Potts, David B. Shmoys, David P. Williamson
1991	A*	`conf`	Scheduling Parallel Machines On-Line FOCS David B. Shmoys, Joel Wein, David P. Williamson
1991	—	`conf`	Scheduling Parallel Machines On-line. On-Line Algorithms David B. Shmoys, Joel Wein, David P. Williamson
1990	J	`jnl`	Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application. Inf. Process. Lett. David B. Shmoys, David P. Williamson
1990	J	`jnl`	Approximation Algorithms for Scheduling Unrelated Parallel Machines. Math. Program. Jan Karel Lenstra, David B. Shmoys, Éva Tardos
1990	J	`jnl`	Flipping Persuasively in Constant Time. SIAM J. Comput. Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer
1990	B	`conf`	Near-Optimal Sequencing with Precedence Constraints. IPCO Leslie A. Hall, David B. Shmoys
1989	A*	`conf`	Approximation Schemes for Constrained Scheduling Problems FOCS Leslie A. Hall, David B. Shmoys
1989	A*	`conf`	Interior-Point Methods in Parallel Computation FOCS Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
1989	J	`jnl`	Simple constant-time consensus protocols in realistic failure models. J. ACM Benny Chor, Michael Merritt, David B. Shmoys
1989	J	`jnl`	The Parallel Complexity of TSP Heuristics. J. Algorithms Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys
1988	J	`jnl`	A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach. SIAM J. Comput. Dorit S. Hochbaum, David B. Shmoys
1987	A*	`conf`	Approximation Algorithms for Scheduling Unrelated Parallel Machines FOCS Jan Karel Lenstra, David B. Shmoys, Éva Tardos
1987	J	`jnl`	Efficient Parallel Algorithms for Edge Coloring Problems. J. Algorithms Howard J. Karloff, David B. Shmoys
1987	J	`jnl`	Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM Dorit S. Hochbaum, David B. Shmoys
1986	J	`jnl`	A Better than "Best Possible" Algorithm to Edge Color Multigraphs. J. Algorithms Dorit S. Hochbaum, Takao Nishizeki, David B. Shmoys
1986	—	`conf`	A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach. FSTTCS Dorit S. Hochbaum, David B. Shmoys
1986	J	`jnl`	A unified approach to approximation algorithms for bottleneck problems. J. ACM Dorit S. Hochbaum, David B. Shmoys
1986	A*	`conf`	Flipping Persuasively in Constant Expected Time (Preliminary Version) FOCS Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer
1985	J	`jnl`	A Best Possible Heuristic for the Math. Oper. Res. Dorit S. Hochbaum, David B. Shmoys
1985	A*	`conf`	Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). PODC Benny Chor, Michael Merritt, David B. Shmoys
1985	A*	`conf`	Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results FOCS Dorit S. Hochbaum, David B. Shmoys
1984	A*	`conf`	Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems STOC Dorit S. Hochbaum, David B. Shmoys
1984	J	`jnl`	Recognizing graphs with fixed interval number is NP-complete. Discret. Appl. Math. Douglas B. West, David B. Shmoys