David B. Shmoys

发表

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..

Recognizing graphs with fixed interval number is NP-complete

David B. Shmoys, Douglas B. West, 1984, Discret. Appl. Math..

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

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

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).

Optimal Network Design for the Spread of Cascades

David B. Shmoys, Adam N. Elmachtoub, Jon M. Conrad, 2010 .

Efficient Parallel Algorithms for Edge Coloring Problems

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

Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems

Alice Paul, David P. Williamson, David B. Shmoys, 2020, Math. Oper. Res..

Fault-tolerant facility location

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

Improved Scheduling Algorithms for Minsum Criteria

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

Bike Angels: An Analysis of Citi Bike's Incentive Program

David B. Shmoys, Hangil Chung, Daniel Freund, 2018, COMPASS.

Inventory and Facility Location Models with Market Selection

Joseph Geunes, David B. Shmoys, H. Edwin Romeijn, 2005, IPCO.

Approximation algorithms for facility location problems (extended abstract)

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

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..

The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners

Ravi Subramanian, Felipe Caro, David B. Shmoys, 2005, Manuf. Serv. Oper. Manag..

Simple constant-time consensus protocols in realistic failure models

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

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).

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

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

The submodular joint replenishment problem

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

A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems

David B. Shmoys, Maurice Cheung, 2011, APPROX-RANDOM.

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

Approximation Algorithms for Capacitated Stochastic Inventory Control Models

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

Permutation vs. non-permutation flow shop schedules

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

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

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

Approximation algorithms for clustering problems

David B. Shmoys, 1999, COLT '99.

Strategic directions in research in theory of computing

Andrew V. Goldberg, John E. Savage, Prabhakar Raghavan, 1996, CSUR.

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem

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

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

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

Approximation Algorithms for Constrained Scheduling

David B. Shmoys, Leslie A. Hall, 1992 .

Approximation algorithms

David P. Williamson, David B. Shmoys, Andreas S. Schulz, 1997 .

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

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

Scheduling parallel machines on-line

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

LP-based approximation algorithms for capacitated facility location

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

An approximation algorithm for the generalized assignment problem

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

Improved approximation algorithms for a capacitated facility location problem

Fabián A. Chudak, David B. Shmoys, 1999, SODA '99.

Improved Lower Bounds for the Universal and a priori TSP

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

Aggregating courier deliveries

David B. Shmoys, Shane G. Henderson, Patrick R. Steele, 2018 .

Use of a Novel Application to Optimize Aircraft Utilization for Non-Urgent Patient Transfers

David B. Shmoys, Shane G. Henderson, Russell D. MacDonald, 2011 .

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).

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.

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

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

Computing near-optimal schedules

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

Scheduling (Dagstuhl Seminar 20081)

Ola Svensson, David B. Shmoys, Nicole Megow, 2020, Dagstuhl Reports.

Algorithms for the universal and a priori TSP

David B. Shmoys, Frans Schalekamp, 2008, Oper. Res. Lett..

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

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

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

David B. Shmoys, Gwen Spencer, 2011, WAOA.

Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization

Chaitanya Swamy, David B. Shmoys, 2012, SIAM J. Comput..

Approximation Algorithms for 2-Stage Stochastic Scheduling Problems

David B. Shmoys, Mauro Sozio, 2007, IPCO.

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

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

Improving christofides' algorithm for the s-t path TSP

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

Improved approximation algorithms for minsum criteria

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

An improved approximation algorithm for the partial latin square extension problem

David B. Shmoys, Rommel G. Regis, Carla P. Gomes, 2003, SODA '03.

Well-solved Special Cases of the Traveling Salesman Problem

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

Scheduling parallel machines on-line

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

VLSI Design, Parallel Computation and Distributed Computing

Baruch Awerbuch, David B. Shmoys, Michel X. Goemans, 1991 .

Computational sustainability

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

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

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

Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract)

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

Flipping Persuasively in Constant Time

David B. Shmoys, Cynthia Dwork, Larry J. Stockmeyer, 1990, SIAM J. Comput..

David B. Shmoys, E. Tardos, 1992 .

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

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

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

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

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

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

Short Shop Schedules

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

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

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

Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

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

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.

The Design of Approximation Algorithms: Bibliography

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

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

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

Cut problems and their application to divide-and-conquer

David B. Shmoys, D. Shmoys, 1996 .

Improved approximation algorithms for shop scheduling problems

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

The Design of Approximation Algorithms

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

Facility location with Service Installation Costs

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

The Parallel Complexity of TSP Heuristics

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

The Soviet Ellipsoid Method and Its Application to Combinatorial Optimization Problems

David B. Shmoys, 2017 .

Stochastic optimization is (almost) as easy as discrete optimization

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

Data Analysis and Optimization for (Citi)Bike Sharing

David B. Shmoys, Eoin O'Mahony, 2015, AAAI.

In Memoriam: Eugene L. Lawler

Jan Karel Lenstra, David B. Shmoys, Tandy Warnow, 1994, J. Comput. Biol..

Primal-dual algorithms for deterministic inventory problems

David B. Shmoys, Retsef Levi, Robin Roundy, 2004, STOC '04.

Approximation Algorithms for Stochastic Inventory Control Models

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

Near-Optimal Sequencing with Precedence Constraints

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

Sequencing and scheduling: algorithms and complexity

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

PUpping Persuasively in CODstant Expeeted Time (Preliminary version)

David B. Shmoys, Cynthia Dwork, Larry Stockmeyer, 1986 .

A constant-factor approximation for the k-median problem

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

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).

Approximation Algorithms for Stochastic Inventory Control Models

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

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

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

Computing near-optimal solutions to combinatorial optimization problems

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

Approximations and Randomization to Boost CSP Techniques

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

Primal-dual schema for capacitated covering problems

David B. Shmoys, Tim Carnes, 2015, Math. Program..

Sincronia: near-optimal network design for coflows

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

Approximation algorithms for 2-stage stochastic optimization problems

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

Approximation schemes for constrained scheduling problems

David B. Shmoys, Leslie A. Hall, 1989, 30th Annual Symposium on Foundations of Computer Science.

Primal-Dual Algorithms for Deterministic Inventory Problems

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

Primal-dual schema for capacitated covering problems

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

Powers of graphs: A powerful approximation technique for bottleneck problems

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

Combinatorics in computer science

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

A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems

David B. Shmoys, Julián Mestre, José Verschae, 2017, SIAM J. Discret. Math..

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..

Some Recent Developments in the Design and Analysis of Approximation Algorithms

David B. Shmoys, D. Shmoys, 1993 .

Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results

David B. Shmoys, Dorit S. Hochbaum, 1985, FOCS.

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.

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.

Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem pdf

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

A PTAS for capacitated sum-of-ratios optimization

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

A unified approach to approximation algorithms for bottleneck problems

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

Maximizing the Spread of Cascades Using Network Design pdf

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

Improved approximation algorithms for network design problems

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

LP-based approximation algorithms for capacitated facility location

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

Traveling Salesman Problem

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

Mathematical Programming Guides Air-Ambulance Routing at Ornge

David B. Shmoys, Shane G. Henderson, Russell D. MacDonald, 2013, Interfaces.

Analytics and Bikes: Riding Tandem with Motivate to Improve Mobility

David B. Shmoys, Shane G. Henderson, Daniel Freund, 2019, Interfaces.

A Better than "Best Possible" Algorithm to Edge Color Multigraphs

Takao Nishizeki, David B. Shmoys, Dorit S. Hochbaum, 1986, J. Algorithms.

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

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

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

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

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

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

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

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

A Best Possible Heuristic for the k-Center Problem

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

Approximation algorithms for supply chain planning and logistics problems with market choice

Joseph Geunes, David B. Shmoys, H. Edwin Romeijn, 2011, Math. Program..

Scheduling Parallel Machines On-Line

David P. Williamson, David B. Shmoys, Joel Wein, 1995, SIAM J. Comput..

A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem

David B. Shmoys, Kunal Talwar, 2008, IPCO.

Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems

Andrew V. Goldberg, Éva Tardos, David B. Shmoys, 1992, SIAM J. Comput..

A Guided Tour of Combinatorial Optimization

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

LP-Based Approximation Algorithms for Traveling Salesman Path Problems pdf

David B. Shmoys, Hyung-Chan An, 2011, ArXiv.

A computational study of the job-shop and the flow-shop scheduling problems

David B. Shmoys, Helena Ramalhinho Dias Lourenco, 1993 .

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

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

An improvement performance guarantee for the partial latin square problem

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

Elements of Scheduling pdf

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

Strategic directions in research in theory of computing

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

Interior-point methods in parallel computation

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

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.

Prize-Collecting TSP with a Budget Constraint

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

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

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

The Design of Approximation Algorithms: Preface

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

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.

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

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

Scheduling Appointments Online: The Power of Deferred Decision-Making pdf

David B. Shmoys, Devin Smedira, 2021, ArXiv.

Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem

David B. Shmoys, Hyung-Chan An, Robert Kleinberg, 2021, ACM Trans. Algorithms.

Combinatorial Approximation Algorithms (Dagstuhl Seminar 9734)

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

Assortment Optimization with Mixtures of Logits

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

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

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

Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem

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

The Sample Average Approximation Method for 2-stage Stochastic Optimization

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

Preface (Special issue in memory of Eugene L. Lawler (1933-1994))

Jan Karel Lenstra, David B. Shmoys, 1998 .

The Design of Approximation Algorithms: Random Sampling and Randomized Rounding of Linear Programs

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

A packing problem you can almost solve by sitting on your suitcase

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

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

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

Computing provably near-optimal policies for stochastic inventory control models

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