David B. Shmoys
According to our database^{1},
David B. Shmoys
authored at least 104 papers
between 1984 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on id.loc.gov

on dnb.info
On csauthors.net:
Bibliography
2021
Combatting Gerrymandering with Social Choice: the Design of Multimember Districts.
CoRR, 2021
Fairmandering: A column generation heuristic for fairnessoptimized political districting.
CoRR, 2021
2020
Math. Oper. Res., 2020
Dagstuhl Reports, 2020
CoRR, 2020
2019
INFORMS J. Appl. Anal., 2019
Computational sustainability: computing for a better world and a sustainable future.
Commun. ACM, 2019
2018
Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, 2018
Proceedings of the 1st ACM SIGCAS Conference on Computing and Sustainable Societies, 2018
2017
A PrimalDual Approximation Algorithm for MinSum SingleMachine Scheduling Problems.
SIAM J. Discret. Math., 2017
Proceedings of the Approximation and Online Algorithms  15th International Workshop, 2017
Minimizing Multimodular Functions and Allocating Capacity in BikeSharing Systems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
2016
Math. Program., 2016
2015
Approximation Algorithms for Fragmenting a Graph Against a StochasticallyLocated Threat.
Theory Comput. Syst., 2015
Math. Program., 2015
J. ACM, 2015
Proceedings of the Computational Sustainability, 2015
Proceedings of the TwentyNinth AAAI Conference on Artificial Intelligence, 2015
2013
Interfaces, 2013
2012
SIAM J. Comput., 2012
Math. Program., 2012
2011
Approximation algorithms for supply chain planning and logistics problems with market choice.
Math. Program., 2011
CoRR, 2011
A PrimalDual Approximation Algorithm for MinSum SingleMachine Scheduling Problems.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011
Cambridge University Press, ISBN: 9780521195270, 2011
2010
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint.
Oper. Res., 2010
Proceedings of the UAI 2010, 2010
Proceedings of the Approximation, 2010
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem.
Proceedings of the Approximation, 2010
2009
Oper. Res. Lett., 2009
2008
ACM Trans. Algorithms, 2008
Oper. Res. Lett., 2008
Manag. Sci., 2008
Oper. Res., 2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008
2007
Provably NearOptimal SamplingBased Policies for Stochastic Inventory Control Models.
Math. Oper. Res., 2007
Math. Oper. Res., 2007
Proceedings of the Integer Programming and Combinatorial Optimization, 2007
Proceedings of the Probabilistic Methods in the Design and Analysis of Algorithms, 23.09., 2007
2006
SIGACT News, 2006
Math. Oper. Res., 2006
An approximation scheme for stochastic linear programming and its application to stochastic integer programs.
J. ACM, 2006
Provably nearoptimal samplingbased algorithms for Stochastic inventory control models.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
2005
Manuf. Serv. Oper. Manag., 2005
Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005
2004
An improved approximation algorithm for the partial Latin square extension problem.
Oper. Res. Lett., 2004
J. Algorithms, 2004
Ann. Oper. Res., 2004
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem.
SIAM J. Comput., 2003
Lagrangian Relaxation for the kMedian Problem: New Insights and Continuity Properties.
Proceedings of the Algorithms, 2003
2002
J. Comput. Syst. Sci., 2002
2000
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000
1999
Approximation Algorithms for PrecedenceConstrained Scheduling Problems on Parallel Machines that Run at Different Speeds.
J. Algorithms, 1999
A 3Approximation Algorithm for the kLevel Uncapacitated Facility Location Problem.
Inf. Process. Lett., 1999
A ConstantFactor Approximation Algorithm for the <i>k</i>Median Problem (Extended Abstract).
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the Tenth Annual ACMSIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999
1998
J. Comb. Optim., 1998
Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998
1997
SIGACT News, 1997
Scheduling to Minimize Average Completion Time: OffLine and OnLine Approximation Algorithms.
Math. Oper. Res., 1997
Oper. Res., 1997
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
Approximation Algorithms for PrecedenceConstrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract).
Proceedings of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms, 1997
1996
Proceedings of the Seventh Annual ACMSIAM Symposium on Discrete Algorithms, 1996
A New Approach to Computing Optimal Schedules for the JobShop Scheduling Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996
1995
SIAM J. Comput., 1995
Math. Oper. Res., 1995
1994
SIAM J. Comput., 1994
Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms. 2325 January 1994, 1994
1993
Math. Program., 1993
Proceedings of the Fourth Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1993
Proceedings of the Combinatorial Optimization, 1993
Proceedings of the Logistics of Production and Inventory, 1993
1992
Using InteriorPoint Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems.
SIAM J. Comput., 1992
Math. Oper. Res., 1992
1991
Oper. Res. Lett., 1991
1990
SIAM J. Comput., 1990
Math. Program., 1990
Inf. Process. Lett., 1990
NearOptimal Sequencing with Precedence Constraints.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990
1989
J. Algorithms, 1989
J. ACM, 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1988
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach.
SIAM J. Comput., 1988
1987
J. Algorithms, 1987
Using dual approximation algorithms for scheduling problems theoretical and practical results.
J. ACM, 1987
1986
J. Algorithms, 1986
J. ACM, 1986
A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
1985
Math. Oper. Res., 1985
Simple ConstantTime Consensus Protocols in Realistic Failure Models (Extended Abstract).
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985
1984
Discret. Appl. Math., 1984
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984