David B. Shmoys

ORCID

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 40

Top Venues

Publications

Saksham Agarwal, Qizhe Cai, Rachit Agarwal, David B. Shmoys, Amin Vahdat
Harmony: A Congestion-free Datacenter Architecture. NSDI (2024)
Varun Suriyanarayana, Varun Sivashankar, Siddharth Gollapudi, David B. Shmoys
Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints. SODA (2024)
Haripriya Pulyassary, Kostas Kollias, Aaron Schild, David B. Shmoys, Manxi Wu
Network Flow Problems with Electric Vehicles. IPCO (2024)
Sander Aarts, David B. Shmoys
Hitting Sets when the Shallow Cell Complexity is Small. CoRR (2023)
Henry W. Robbins, Samuel C. Gutekunst, David B. Shmoys, David P. Williamson
GILP: An Interactive Tool for Visualizing the Simplex Algorithm. SIGCSE (1) (2023)
Sander Aarts, David B. Shmoys
Hitting Sets when the Shallow Cell Complexity is Small. WAOA (2023)
Woo-Hyung Cho, David B. Shmoys, Shane G. Henderson
SPT optimality (mostly) via linear programming. Oper. Res. Lett. 51 (1) (2023)
Haripriya Pulyassary, Kostas Kollias, Aaron Schild, David B. Shmoys, Manxi Wu
Network Flow Problems with Electric Vehicles. CoRR (2023)
Sander Aarts, David B. Shmoys, Alex Coy
An Interpretable Determinantal Choice Model for Subset Selection. CoRR (2023)
Tinghan Ye, David B. Shmoys
A min-max theorem for the minimum fleet-size problem. Oper. Res. Lett. 51 (3) (2023)
Nicole Megow, Benjamin Moseley, David B. Shmoys, Ola Svensson, Sergei Vassilvitskii, Jens Schlöter
Scheduling (Dagstuhl Seminar 23061). Dagstuhl Reports 13 (2) (2023)
Sander Aarts, Manxi Wu, David B. Shmoys
Sharing the Cost of IoT Wireless Coverage with a Strengthened Linear Programming Formulation. CoRR (2023)
Daniel Freund, Shane G. Henderson, David B. Shmoys
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. Oper. Res. 70 (5) (2022)
Devin Smedira, David B. Shmoys
Scheduling Appointments Online: The Power of Deferred Decision-Making. WAOA (2022)
Henry W. Robbins, Samuel C. Gutekunst, Frans Schalekamp, David B. Shmoys, David P. Williamson
GILP: An Interactive Tool for Visualizing the Simplex Algorithm. CoRR (2022)
Tinghan Ye, David B. Shmoys
A min-max theorem for the minimum fleet-size problem. CoRR (2022)
Nikhil Garg, Wes Gurnee, David Rothschild, David B. Shmoys
Combatting Gerrymandering with Social Choice: The Design of Multi-member Districts. EC (2022)
Woo-Hyung Cho, Shane G. Henderson, David B. Shmoys
Scheduling with Predictions. CoRR (2022)
Rachit Agarwal, Shijin Rajakrishnan, David B. Shmoys
From Switch Scheduling to Datacenter Scheduling: Matching-Coordinated Greed is Good. PODC (2022)
Wes Gurnee, David B. Shmoys
Fairmandering: A column generation heuristic for fairness-optimized political districting. ACDA (2021)
Devin Smedira, David B. Shmoys
Scheduling Appointments Online: The Power of Deferred Decision-Making. CoRR (2021)
Omar El Housni, Vineet Goyal, David B. Shmoys
On the Power of Static Assignment Policies for Robust Facility Location Problems. IPCO (2021)
Nikhil Garg, Wes Gurnee, David Rothschild, David B. Shmoys
Combatting Gerrymandering with Social Choice: the Design of Multi-member Districts. CoRR (2021)
Hyung-Chan An, Robert Kleinberg, David B. Shmoys
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. ACM Trans. Algorithms 17 (4) (2021)
Wes Gurnee, David B. Shmoys
Fairmandering: A column generation heuristic for fairness-optimized political districting. CoRR (2021)
Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems. Math. Oper. Res. 45 (2) (2020)
Hyung-Chan An, Robert Kleinberg, David B. Shmoys
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. CoRR (2020)
Jan Karel Lenstra, David B. Shmoys
Elements of Scheduling. CoRR (2020)
Nicole Megow, David B. Shmoys, Ola Svensson
Scheduling (Dagstuhl Seminar 20081). Dagstuhl Reports 10 (2) (2020)
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
Computational sustainability: computing for a better world and a sustainable future. Commun. ACM 62 (9) (2019)
Daniel Freund, Shane G. Henderson, Eoin O'Mahony, David B. Shmoys
Analytics and Bikes: Riding Tandem with Motivate to Improve Mobility. INFORMS J. Appl. Anal. 49 (5) (2019)
Saksham Agarwal, Shijin Rajakrishnan, Akshay Narayan, Rachit Agarwal, David B. Shmoys, Amin Vahdat
Sincronia: near-optimal network design for coflows. SIGCOMM (2018)
Hangil Chung, Daniel Freund, David B. Shmoys
Bike Angels: An Analysis of Citi Bike's Incentive Program. COMPASS (2018)
Soroush Alamdari, David B. Shmoys
A Bicriteria Approximation Algorithm for the k-Center and k-Median Problems. WAOA (2017)
Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson
Prize-Collecting TSP with a Budget Constraint. ESA (2017)
Daniel Freund, Shane G. Henderson, David B. Shmoys
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. IPCO (2017)
Maurice Cheung, Julián Mestre, David B. Shmoys, José Verschae
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. SIAM J. Discret. Math. 31 (2) (2017)
Maurice Cheung, Julián Mestre, David B. Shmoys, José Verschae
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. CoRR (2016)
Maurice Cheung, Adam N. Elmachtoub, Retsef Levi, David B. Shmoys
The submodular joint replenishment problem. Math. Program. 158 (1-2) (2016)
Daniel Freund, Shane G. Henderson, David B. Shmoys
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems. CoRR (2016)
David B. Shmoys, Gwen Spencer
Approximation Algorithms for Fragmenting a Graph Against a Stochastically-Located Threat. Theory Comput. Syst. 56 (1) (2015)
Eoin O'Mahony, David B. Shmoys
Data Analysis and Optimization for (Citi)Bike Sharing. AAAI (2015)
Tim Carnes, David B. Shmoys
Primal-dual schema for capacitated covering problems. Math. Program. 153 (2) (2015)
Divya Singhvi, Somya Singhvi, Peter I. Frazier, Shane G. Henderson, Eoin O'Mahony, David B. Shmoys, Dawn B. Woodard
Predicting Bike Usage for New York City's Bike Sharing System. AAAI Workshop: Computational Sustainability (2015)
Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys
Improving Christofides' Algorithm for the s-t Path TSP. J. ACM 62 (5) (2015)
Timothy A. Carnes, Shane G. Henderson, David B. Shmoys, Mahvareh Ahghari, Russell D. MacDonald
Mathematical Programming Guides Air-Ambulance Routing at Ornge. Interfaces 43 (3) (2013)
Chaitanya Swamy, David B. Shmoys
Sampling-Based Approximation Algorithms for Multistage Stochastic Optimization. SIAM J. Comput. 41 (4) (2012)
Hyung-Chan An, Robert Kleinberg, David B. Shmoys
Improving christofides' algorithm for the s-t path TSP. STOC (2012)
Retsef Levi, David B. Shmoys, Chaitanya Swamy
LP-based approximation algorithms for capacitated facility location. Math. Program. 131 (1-2) (2012)
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
Maximizing the Spread of Cascades Using Network Design CoRR (2012)
Tim Carnes, David B. Shmoys
Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem. APPROX-RANDOM (2011)
David B. Shmoys, Gwen Spencer
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat. WAOA (2011)
Maurice Cheung, David B. Shmoys
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. APPROX-RANDOM (2011)
Joseph Geunes, Retsef Levi, H. Edwin Romeijn, David B. Shmoys
Approximation algorithms for supply chain planning and logistics problems with market choice. Math. Program. 130 (1) (2011)
Hyung-Chan An, Robert Kleinberg, David B. Shmoys
Improving Christofides' Algorithm for the s-t Path TSP CoRR (2011)
Hyung-Chan An, David B. Shmoys
LP-Based Approximation Algorithms for Traveling Salesman Path Problems CoRR (2011)
Paat Rusmevichientong, Zuo-Jun Max Shen, David B. Shmoys
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint. Oper. Res. 58 (6) (2010)
Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. APPROX-RANDOM (2010)
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
Maximizing the Spread of Cascades Using Network Design. UAI (2010)
Igor Gorodezky, Robert D. Kleinberg, David B. Shmoys, Gwen Spencer
TSP. APPROX-RANDOM (2010)
Paat Rusmevichientong, Zuo-Jun Max Shen, David B. Shmoys
A PTAS for capacitated sum-of-ratios optimization. Oper. Res. Lett. 37 (4) (2009)
Retsef Levi, Robin Roundy, David B. Shmoys, Van-Anh Truong
Approximation Algorithms for Capacitated Stochastic Inventory Control Models. Oper. Res. 56 (5) (2008)
Chaitanya Swamy, David B. Shmoys
Fault-tolerant facility location. ACM Trans. Algorithms 4 (4) (2008)
Frans Schalekamp, David B. Shmoys
Algorithms for the universal and a priori TSP. Oper. Res. Lett. 36 (1) (2008)
Tim Carnes, David B. Shmoys
Primal-Dual Schema for Capacitated Covering Problems. IPCO (2008)
David B. Shmoys, Kunal Talwar
A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem. IPCO (2008)
Retsef Levi, Robin Roundy, David B. Shmoys, Maxim Sviridenko
A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem. Manag. Sci. 54 (4) (2008)
David B. Shmoys, Mauro Sozio
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems. IPCO (2007)
Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys
Approximation Algorithms for Stochastic Inventory Control Models. Math. Oper. Res. 32 (2) (2007)
Chaitanya Swamy, David B. Shmoys
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization. Probabilistic Methods in the Design and Analysis of Algorithms (2007)
Retsef Levi, Robin Roundy, David B. Shmoys
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models. Math. Oper. Res. 32 (4) (2007)
Retsef Levi, Robin Roundy, David B. Shmoys
Primal-Dual Algorithms for Deterministic Inventory Problems. Math. Oper. Res. 31 (2) (2006)
Chaitanya Swamy, David B. Shmoys
Approximation Algorithms for 2-Stage Stochastic Optimization Problems. FSTTCS (2006)
David B. Shmoys, Chaitanya Swamy
An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM 53 (6) (2006)
Retsef Levi, Robin Roundy, David B. Shmoys
Provably near-optimal sampling-based algorithms for Stochastic inventory control models. STOC (2006)
Chaitanya Swamy, David B. Shmoys
Approximation algorithms for 2-stage stochastic optimization problems. SIGACT News 37 (1) (2006)
Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys
Approximation Algorithms for Stochastic Inventory Control Models. IPCO (2005)
Retsef Levi, Martin Pál, Robin O. Roundy, David B. Shmoys, Ravi Subramanian, Xinxin Hu, Gad Allon, Felipe Caro, Holly S. Lutze
The MSOM Society Student Paper Competition: Extended Abstracts of 2004 Winners. Manuf. Serv. Oper. Manag. 7 (1) (2005)
Chaitanya Swamy, David B. Shmoys
Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization. Algorithms for Optimization with Incomplete Information (2005)
Chaitanya Swamy, David B. Shmoys
Sampling-based Approximation Algorithms for Multi-stage Stochastic. FOCS (2005)
Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys
Inventory and Facility Location Models with Market Selection. IPCO (2005)
Retsef Levi, Robin Roundy, David B. Shmoys
A constant approximation algorithm for the one-warehouse multi-retailer problem. SODA (2005)
David B. Shmoys
Foreword. J. Algorithms 50 (2) (2004)
David B. Shmoys, Chaitanya Swamy
Stochastic Optimization is (Almost) as easy as Deterministic Optimization. FOCS (2004)
Retsef Levi, Robin Roundy, David B. Shmoys
Primal-dual algorithms for deterministic inventory problems. STOC (2004)
Carla P. Gomes, David B. Shmoys
Approximations and Randomization to Boost CSP Techniques. Ann. Oper. Res. 130 (1-4) (2004)
Carla P. Gomes, Rommel G. Regis, David B. Shmoys
An improved approximation algorithm for the partial Latin square extension problem. Oper. Res. Lett. 32 (5) (2004)
David B. Shmoys, Chaitanya Swamy, Retsef Levi
Facility location with Service Installation Costs. SODA (2004)
Retsef Levi, David B. Shmoys, Chaitanya Swamy
LP-based Approximation Algorithms for Capacitated Facility Location. IPCO (2004)
Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys
Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties. ESA (2003)
Chaitanya Swamy, David B. Shmoys
Fault-tolerant facility location. SODA (2003)
Fabián A. Chudak, David B. Shmoys
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem. SIAM J. Comput. 33 (1) (2003)
Carla P. Gomes, Rommel G. Regis, David B. Shmoys
An improved approximation algorithm for the partial latin square extension problem. SODA (2003)
Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
A Constant-Factor Approximation Algorithm for the k-Median Problem. J. Comput. Syst. Sci. 65 (1) (2002)
David B. Shmoys
Approximation algorithms for facility location problems. APPROX (2000)
Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
-Median Problem (Extended Abstract). STOC (1999)
Fabián A. Chudak, David B. Shmoys
Improved Approximation Algorithms for a Capacitated Facility Location Problem. SODA (1999)
Karen Aardal, Fabián A. Chudak, David B. Shmoys
A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. Inf. Process. Lett. 72 (5-6) (1999)
Fabián A. Chudak, David B. Shmoys
Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds. J. Algorithms 30 (2) (1999)
David B. Shmoys
Approximation Algorithms for Clustering Problems. COLT (1999)

David B. Shmoys.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

David B. Shmoys