D. Shmoys

发表

An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem

D. Hochbaum, D. Shmoys, 1985 .

Fast approximation algorithms for fractional packing and covering problems

Éva Tardos, David B. Shmoys, Serge A. Plotkin, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

Fast Approximation Algorithms for Fractional Packing and Covering Problems

Éva Tardos, David B. Shmoys, Serge A. Plotkin, 1995, Math. Oper. Res..

Approximation algorithms for facility location problems (extended abstract)

Éva Tardos, Karen Aardal, David B. Shmoys, 1997, STOC '97.

An improved approximation algorithm for the generalized assignment problem

D. Shmoys, va Tardos, 1993 .

A best possible approximation algorithm for the k--center problem

D. Hochbaum, D. Shmoys, 1985 .

Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem pdf

David B. Shmoys, Robert D. Kleinberg, Hyung-Chan An, 2010, APPROX-RANDOM.

Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

E. Lawler, J. Lenstra, D. Shmoys, 1986 .

In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation

J. Lenstra, D. Shmoys, 2016 .

Chapter 9 Sequencing and scheduling: Algorithms and complexity

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1993, Logistics of Production and Inventory.

Cut problems and their application to divide-and-conquer

David B. Shmoys, D. Shmoys, 1996 .

An approximation algorithm for the generalized assignment problem

Éva Tardos, David B. Shmoys, D. Shmoys, 1993, Math. Program..

Traveling Salesman Problem

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 2016 .

Approximation algorithms for scheduling unrelated parallel machines

Jan Karel Lenstra, Éva Tardos, David B. Shmoys, 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem

D. Shmoys, C. Gomes, 2002 .

A constant-factor approximation algorithm for the k-median problem (extended abstract)

Sudipto Guha, Éva Tardos, David B. Shmoys, 1999, STOC '99.

Computing near-optimal solutions to combinatorial optimization problems

David B. Shmoys, D. Shmoys, 1994, Combinatorial Optimization.

A Best Possible Heuristic for the k-Center Problem

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1985, Math. Oper. Res..

Well-solved special cases

E. Lawler, P. Gilmore, D. Shmoys, 1985 .

Computational sustainability

Thomas G. Dietterich, Steve Kelling, Warren B. Powell, 2011, AI Mag..

The Design of Approximation Algorithms

David P. Williamson, David B. Shmoys, D. Shmoys, 2011 .

The Design of Approximation Algorithms: Rounding Data and Dynamic Programming

David P. Williamson, D. Shmoys, 2011 .

Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters

P. Rusmevichientong, D. Shmoys, Huseyin Topaloglu, 2014 .

Predicting Bike Usage for New York City's Bike Sharing System

David B. Shmoys, Peter I. Frazier, Shane G. Henderson, 2015, AAAI Workshop: Computational Sustainability.

Approximation Algorithms for Fragmenting a Graph Against a Stochastically-Located Threat

David B. Shmoys, Gwen Spencer, D. Shmoys, 2014, Theory of Computing Systems.

Approximation algorithms via the primal-dual schema: applications of the simple dual-ascent method to problems from logistics

D. Shmoys, Tim Carnes, 2010 .

5 CUT PROBLEMSAND THEIR APPLICATION TO DIVIDE-AND-CONQUER

D. Shmoys, 1996 .

The Promise of LP to Boost CSP Techniques for Combinatorial Problems

D. Shmoys, C. Gomes, 2002 .

A time-oriented approach to computing optimal schedules for the job-shop scheduling problem

David B. Shmoys, Paul Martin, D. Shmoys, 1996 .

Computing provably near-optimal policies for stochastic inventory control models

Robin O. Roundy, David B. Shmoys, Retsef Levi, 2005 .

Selective mapping: a strategy for optimizing the construction of high-density linkage maps.

D G Brown, D B Shmoys, R. Durrett, 2000, Genetics.

Éva Tardos, David B. Shmoys, D. Shmoys, 1993, SODA '93.

New Policies for Stochastic Inventory Control Models: Theoretical and Computational Results

Peter Jackson, Robin O. Roundy, David B. Shmoys, 2007 .

Approximation Algorithms for Stochastic Inventory Control Models ( DRAFT )

D. Shmoys, R. Roundy, R. Levi, 2005 .

Chapter 40 Combinatorics in Computer Science

D. Shmoys, É. Tardos, L. Lovv, 1990 .

Improved approximation algorithms for the k-level facility location problem

Fabián A. Chudak, K. Aardal, D. Shmoys, 1999 .

Addendum: COVID-19 Mathematical Modeling for Cornell’s Fall Semester

P. Frazier, D. Shmoys, A. Janmohamed, 2020 .

Strategic directions in research in theory of computing

John E. Savage, Prabhakar Raghavan, David B. Shmoys, 1997, SIGACT News.

A Simpler Primal-Dual Proof of Lawler ’ s Algorithm

Renato Paes Leme, D. Shmoys, R. Leme, 2009 .

Parallel machines - Minmax criteria, no preemption

Jan Karel Lenstra, D. B. Shmoys, J. Lenstra, 2019 .

Combinatorics in computer science

Éva Tardos, László Lovász, David B. Shmoys, 1996 .

The travelling salesman problem (A guided tour of combinatorial optimisation ), edited by E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys. Pp 465. £39·95. 1985. ISBN 0-471-90413-9 (Wiley)

Eugene L. Lawler, Michael Worboys, J. K. Lenstra, 1986, The Mathematical Gazette.

Strategic directions in research in theory of computing

Stephen R. Mahaney, A. Goldberg, J. Savage, 1996, CSUR.

Near-Optimal Sequencing with Precedence Constraints

David B. Shmoys, Leslie A. Hall, D. Shmoys, 1990, IPCO.

Fairmandering: A column generation heuristic for fairness-optimized political districting

David B. Shmoys, Wes Gurnee, D. Shmoys, 2021, ACDA.

Improved approximation algorithms for minsum criteria

David B. Shmoys, Cynthia Ann Phillips, Andreas S. Schulz, 1996 .

Some Recent Developments in the Design and Analysis of Approximation Algorithms

David B. Shmoys, D. Shmoys, 1993 .

Combatting Gerrymandering with Social Choice: The Design of Multi-member Districts

David M. Rothschild, D. Shmoys, Nikhil Garg, 2021, EC.

A Guided Tour of Combinatorial Optimization

Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, 1985 .

Scheduling parallel machines on-line

David P. Williamson, David B. Shmoys, Joel Wein, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

An improvement performance guarantee for the partial latin square problem

David B. Shmoys, Rommel G. Regis, Carla P. Gomes, 2002 .

Well-solved Special Cases of the Traveling Salesman Problem

Eugene L. Lawler, David B. Shmoys, P. C. Gilmore, 1984 .

A constant-factor approximation for the k-median problem

David B. Shmoys, Moses Charikar, E. Taxdos, 1999 .

GILP: An Interactive Tool for Visualizing the Simplex Algorithm

David P. Williamson, Samuel C. Gutekunst, D. Shmoys, 2022, ArXiv.

Primal-dual schema for capacitated covering problems

D. Shmoys, Tim Carnes, 2014, Mathematical Programming.

MIT Open Access Articles The submodular joint replenishment problem

D. Shmoys, R. Levi, 2022 .

The submodular joint replenishment problem

Adam N. Elmachtoub, D. Shmoys, R. Levi, 2015, Mathematical Programming.

Scheduling with Predictions

D. Shmoys, Woo-Hyung Cho, S. Henderson, 2022, ArXiv.

SPT optimality (mostly) via linear programming

D. Shmoys, S. Henderson, Woo-Hyung Cho, 2022, Oper. Res. Lett..

Approximation Algorithms for Fragmenting a Graph Against a Stochastically-Located Threat

D. Shmoys, Gwen Spencer, 2011, Theory of Computing Systems.

Using dual approximation algorithms for scheduling problems: practical and theoretical results

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1987 .

A Bicriteria Approximation Algorithm for the k-Center and k-Median Problems

David B. Shmoys, Soroush Alamdari, D. Shmoys, 2017, WAOA.

A constant-factor approximation algorithm for the k-median problem (extended abstract)

Sudipto Guha, Éva Tardos, David B. Shmoys, 1999, STOC '99.

Powers of graphs: A powerful approximation technique for bottleneck problems

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1984, STOC '84.

A unified approach to approximation algorithms for bottleneck problems

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1986, JACM.

An approximation scheme for stochastic linear programming and its application to stochastic integer programs

Chaitanya Swamy, David B. Shmoys, D. Shmoys, 2006, JACM.

Flipping persuasively in constant expected time

Cynthia Dwork, David Shmoys, Larry Stockmeyer, 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

Simple constant-time consensus protocols in realistic failure models (extended abstract)

B. Chor, D. Shmoys, Michael Merritt, 1985, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

Approximation algorithms for facility location problems

David B. Shmoys, D. Shmoys, 2000, APPROX.

Using dual approximation algorithms for scheduling problems: Theoretical and practical results

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

Interior-point methods in parallel computation

Andrew V. Goldberg, Éva Tardos, David B. Shmoys, 1989, 30th Annual Symposium on Foundations of Computer Science.

Elements of Scheduling pdf

Jan Karel Lenstra, David B. Shmoys, J. Lenstra, 2020, ArXiv.

Modeling for COVID-19 college reopening decisions: Cornell, a case study

P. Frazier, D. Shmoys, S. Henderson, 2021, Proceedings of the National Academy of Sciences.

Booster vaccination protection against SARS-CoV-2 infections in young adults during an Omicron BA.1-predominant period: A retrospective cohort study

P. Frazier, D. Shmoys, M. Osman, 2023, PLoS medicine.

Sequencing and scheduling: algorithms and complexity

Eugene L. Lawler, Jan Karel Lenstra, David B. Shmoys, 1989 .

Scheduling parallel machines on-line

David P. Williamson, David B. Shmoys, Joel Wein, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

Sampling-based approximation algorithms for multi-stage stochastic optimization

Chaitanya Swamy, David B. Shmoys, D. Shmoys, 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem

David B. Shmoys, Paul Martin, D. Shmoys, 1996, IPCO.

Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better

David B. Shmoys, Leslie A. Hall, D. Shmoys, 1992, Math. Oper. Res..

Sincronia: near-optimal network design for coflows

Amin Vahdat, David B. Shmoys, Shijin Rajakrishnan, 2018, SIGCOMM.

GILP: An Interactive Tool for Visualizing the Simplex Algorithm

David P. Williamson, Samuel C. Gutekunst, D. Shmoys, 2022, SIGCSE.

Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint

David B. Shmoys, Zuo-Jun Max Shen, Paat Rusmevichientong, 2010, Oper. Res..

The Parallel Complexity of TSP Heuristics

Jan Karel Lenstra, David B. Shmoys, Gerard A. P. Kindervater, 1989, J. Algorithms.

R 5 CUT PROBLEMS AND THEIR APPLICATION TO DIVIDE-AND-CONQUER

D. Shmoys, 2021 .

A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1988, SIAM J. Comput..

Short Shop Schedules

Han Hoogeveen, Jan Karel Lenstra, David P. Williamson, 1997, Oper. Res..

Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds

Fabián A. Chudak, David B. Shmoys, D. Shmoys, 1997, SODA '97.

Improved approximation algorithms for network design problems

Andrew V. Goldberg, Éva Tardos, David P. Williamson, 1994, SODA '94.

Improved approximation algorithms for shop scheduling problems

David B. Shmoys, Clifford Stein, Joel Wein, 1991, SODA '91.

Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem

David B. Shmoys, Tim Carnes, D. Shmoys, 2011, APPROX-RANDOM.

Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

Fabián A. Chudak, David B. Shmoys, D. Shmoys, 2003, SIAM J. Comput..

Strategic directions in research in theory of computing

Stephen R. Mahaney, A. Goldberg, J. Savage, 1997, SIGACT News.

Efficient Parallel Algorithms for Edge Coloring Problems

David B. Shmoys, Howard J. Karloff, H. Karloff, 1987, J. Algorithms.

Hitting Sets when the Shallow Cell Complexity is Small

D. Shmoys, S. Aarts, 2023, ArXiv.

Primal-dual schema for capacitated covering problems

David B. Shmoys, Tim Carnes, D. Shmoys, 2008, Math. Program..

The submodular joint replenishment problem

David B. Shmoys, Adam N. Elmachtoub, Retsef Levi, 2015, Math. Program..

Computing near-optimal schedules

Jan Karel Lenstra, David B. Shmoys, J. Lenstra, 1995 .

Maximizing the Spread of Cascades Using Network Design pdf

David B. Shmoys, Adam N. Elmachtoub, Ashish Sabharwal, 2010, UAI.

Facility location with Service Installation Costs

Chaitanya Swamy, David B. Shmoys, Retsef Levi, 2004, SODA '04.

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

David B. Shmoys, Andreas S. Schulz, Joel Wein, 1997, Math. Oper. Res..

Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models

David B. Shmoys, Retsef Levi, Robin Roundy, 2007, Math. Oper. Res..

The single machine - Minmax criteria

Eugene L. Lawler, Jan Karel Lenstra, D. B. Shmoys, 2019 .

Approximations and Randomization to Boost CSP Techniques

David B. Shmoys, Carla P. Gomes, D. Shmoys, 2004, Ann. Oper. Res..

Assortment Optimization with Mixtures of Logits

David B. Shmoys, Huseyin Topaloglu, Paat Rusmevichientong, 2010 .

Simple constant-time consensus protocols in realistic failure models

David B. Shmoys, Michael Merritt, Benny Chor, 1989, JACM.

Stochastic optimization is (almost) as easy as discrete optimization

Chaitanya Swamy, David B. Shmoys, D. Shmoys, 2004, FOCS 2004.

Boosters protect against SARS-CoV-2 infections in young adults during an Omicron-predominant period

P. Frazier, D. Shmoys, G. Meredith, 2022, medRxiv.

Improved Scheduling Algorithms for Minsum Criteria

Cynthia A. Phillips, David B. Shmoys, Andreas S. Schulz, 1996, ICALP.

From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good

D. Shmoys, R. Agarwal, S. Rajakrishnan, 2022, PODC.

Fairmandering: A column generation heuristic for fairness-optimized political districting

D. Shmoys, Wes Gurnee, 2021, ACDA.

Approximation algorithms for 2-stage stochastic optimization problems

Chaitanya Swamy, David B. Shmoys, D. Shmoys, 2006, SIGA.

The Sample Average Approximation Method for 2-stage Stochastic Optimization

Chaitanya Swamy, David B. Shmoys, D. Shmoys, 2005 .

Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties

David B. Shmoys, Aaron Archer, Ranjithkumar Rajagopalan, 2003, ESA.

Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application

David P. Williamson, David B. Shmoys, D. Shmoys, 1990, Inf. Process. Lett..

Stochastic optimization is (almost) as easy as deterministic optimization

Chaitanya Swamy, David B. Shmoys, D. Shmoys, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization

Chaitanya Swamy, David B. Shmoys, D. Shmoys, 2005, Algorithms for Optimization with Incomplete Information.

LP-based approximation algorithms for capacitated facility location

Chaitanya Swamy, David B. Shmoys, Retsef Levi, 2004, Math. Program..

Fault-tolerant facility location

Chaitanya Swamy, David B. Shmoys, D. Shmoys, 2003, SODA '03.

On the Power of Static Assignment Policies for Robust Facility Location Problems

David Shmoys, Vineet Goyal, Omar El Housni, 2020, IPCO.

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

Andreas S. Schulz, D. Shmoys, J. Wein, 1997, Mathematics of Operations Research.

Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems pdf

David B. Shmoys, Shane G. Henderson, Daniel Freund, 2016, IPCO.

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem

Cynthia A. Phillips, David B. Shmoys, Andreas S. Schulz, 1998, J. Comb. Optim..

Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems

David B. Shmoys, D. Shmoys, 1998, APPROX.

Scheduling to minimize average completion time: off-line and on-line algorithms

David B. Shmoys, Joel Wein, Leslie A. Hall, 1996, SODA '96.

Improved Lower Bounds for the Universal and a priori TSP

David B. Shmoys, Robert D. Kleinberg, Gwen Spencer, 2010, APPROX-RANDOM.

Approximation algorithms for stochastic combinatorial optimization, with applications in sustainability

David Shmoys, Gwen Spencer, D. Shmoys, 2012 .

Approximation Algorithms for Capacitated Stochastic Inventory Control Models

David B. Shmoys, Retsef Levi, Van-Anh Truong, 2008, Oper. Res..

Approximation Algorithms for Stochastic Inventory Control Models

David B. Shmoys, Retsef Levi, Robin Roundy, 2005, Math. Oper. Res..

Combinatorial Approximation Algorithms (Dagstuhl Seminar 9734)

Gerhard J. Woeginger, Yuval Rabani, David B. Shmoys, 2021 .

Approximation Algorithms for Stochastic Inventory Control Models the Models Our Work Our Results Conclusions and Subsequent Work Emissions Compliance Strategies: a Permit Auction Model Optimal Joint Inventory and Transshipment Control under Uncertain Capacity

D. Simchi-Levi, D. Shmoys, Izak Duenyas, 2022 .

Permutation vs. non-permutation flow shop schedules

Chris N. Potts, David P. Williamson, David B. Shmoys, 1991, Oper. Res. Lett..

A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem

Karen Aardal, Fabián A. Chudak, David B. Shmoys, 1999, Inf. Process. Lett..

The traveling salesman problem

E. Lawler, J. Lenstra, D. Shmoys, 1985 .

Improving christofides' algorithm for the s-t path TSP

David B. Shmoys, Robert D. Kleinberg, Hyung-Chan An, 2011, STOC '12.

A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach

David B. Shmoys, Dorit S. Hochbaum, D. Hochbaum, 1986, FSTTCS.

A constant approximation algorithm for the one-warehouse multi-retailer problem

David B. Shmoys, Maxim Sviridenko, Robin Roundy, 2005, SODA '05.

Sincronia

Amin Vahdat, D. Shmoys, Akshay Narayan, 2018, Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication.

Sequencing and scheduling: algorithms and complexity

Ahg Alexander Rinnooy Kan, E. Lawler, J. Lenstra, 1989 .

Sequencing and scheduling : algorithms and complexity

E. Lawler, D. Shmoys, Jan Karel Lenstra, 1993 .

Sequencing and Scheduling: Algorithms and Complexity, in Logistics of production and inventory

Eugene L. Lawler, Jan Karel Lenstra, David B. Shmoys, 1993 .

Scheduling to minimize average completion time: offline and online algorithms

Andreas S. Schulz, D. Shmoys, J. Wein, 1997 .

Provably near-optimal sampling-based algorithms for Stochastic inventory control models

David B. Shmoys, Retsef Levi, Robin Roundy, 2006, STOC '06.

Approximation algorithms for facility location problems (extended abstract)

K. Aardal, D. Shmoys, É. Tardos, 1997, STOC '97.

An Interpretable Determinantal Choice Model for Subset Selection

D. Shmoys, S. Aarts, A. Coy, 2023, arXiv.org.

Prize-Collecting TSP with a Budget Constraint

Alice Paul, David P. Williamson, David B. Shmoys, 2017, ESA.