| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Daniel Sheldon, Bistra N. 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 |
DBLP BibTeX RDF |
|
| 1 | Retsef Levi, David B. Shmoys, Chaitanya Swamy |
LP-based approximation algorithms for capacitated facility location.  |
Math. Program.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hyung-Chan An, Robert Kleinberg, David B. Shmoys |
Improving christofides' algorithm for the s-t path TSP.  |
STOC  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hyung-Chan An, David B. Shmoys |
LP-Based Approximation Algorithms for Traveling Salesman Path Problems  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hyung-Chan An, Robert Kleinberg, David B. Shmoys |
Improving Christofides' Algorithm for the s-t Path TSP  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Joseph Geunes, Retsef Levi, H. Edwin Romeijn, David B. Shmoys |
Approximation algorithms for supply chain planning and logistics problems with market choice.  |
Math. Program.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Gwen Spencer |
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat.  |
WAOA  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Cheung, David B. Shmoys |
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems.  |
APPROX-RANDOM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Carnes, David B. Shmoys |
Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem.  |
APPROX-RANDOM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paat Rusmevichientong, Zuo-Jun Max Shen, David B. Shmoys |
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint.  |
Operations Research  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Sheldon, Bistra N. 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 |
DBLP BibTeX RDF |
|
| 1 | Hyung-Chan An, Robert D. Kleinberg, David B. Shmoys |
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem.  |
APPROX-RANDOM  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Gorodezky, Robert D. Kleinberg, David B. Shmoys, Gwen Spencer |
Improved Lower Bounds for the Universal and a priori TSP.  |
APPROX-RANDOM  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paat Rusmevichientong, Zuo-Jun Max Shen, David B. Shmoys |
A PTAS for capacitated sum-of-ratios optimization.  |
Oper. Res. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frans Schalekamp, David B. Shmoys |
Algorithms for the universal and a priori TSP.  |
Oper. Res. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Retsef Levi, Robin Roundy, David B. Shmoys, Van Anh Truong |
Approximation Algorithms for Capacitated Stochastic Inventory Control Models.  |
Operations Research  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Chaitanya Swamy, David B. Shmoys |
Fault-tolerant facility location.  |
ACM Transactions on Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithms, facility location, k-median problem |
| 1 | Retsef Levi, Robin Roundy, David B. Shmoys, Maxim Sviridenko |
A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem.  |
Management Science  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Kunal Talwar |
A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem.  |
IPCO  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Carnes, David B. Shmoys |
Primal-Dual Schema for Capacitated Covering Problems.  |
IPCO  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Retsef Levi, Robin Roundy, David B. Shmoys |
Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models.  |
Math. Oper. Res.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys |
Approximation Algorithms for Stochastic Inventory Control Models.  |
Math. Oper. Res.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chaitanya Swamy, David B. Shmoys |
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization.  |
Probabilistic Methods in the Design and Analysis of Algorithms  |
2007 |
DBLP BibTeX RDF |
|
| 1 | David B. Shmoys, Mauro Sozio |
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems.  |
IPCO  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Chaitanya Swamy |
An approximation scheme for stochastic linear programming and its application to stochastic integer programs.  |
J. ACM  |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithms, randomized algorithms, convex optimization |
| 1 | Retsef Levi, Robin Roundy, David B. Shmoys |
Primal-Dual Algorithms for Deterministic Inventory Problems.  |
Math. Oper. Res.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chaitanya Swamy, David B. Shmoys |
Approximation algorithms for 2-stage stochastic optimization problems.  |
SIGACT News  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chaitanya Swamy, David B. Shmoys |
Approximation Algorithms for 2-Stage Stochastic Optimization Problems.  |
FSTTCS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Retsef Levi, Robin Roundy, David B. Shmoys |
Provably near-optimal sampling-based algorithms for Stochastic inventory control models.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
inventory problems, sampling-based algorithms, approximation algorithms, black box |
| 1 | Retsef Levi, Robin Roundy, David B. Shmoys |
A constant approximation algorithm for the one-warehouse multi-retailer problem.  |
SODA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Chaitanya Swamy, David B. Shmoys |
Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization.  |
Algorithms for Optimization with Incomplete Information  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys |
Approximation Algorithms for Stochastic Inventory Control Models.  |
IPCO  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys |
Inventory and Facility Location Models with Market Selection.  |
IPCO  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Chaitanya Swamy, David B. Shmoys |
Sampling-based Approximation Algorithms for Multi-stage Stochastic.  |
FOCS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Carla P. Gomes, Rommel G. Regis, David B. Shmoys |
An improved approximation algorithm for the partial Latin square extension problem.  |
Oper. Res. Lett.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys |
Foreword.  |
J. Algorithms  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Carla P. Gomes, David B. Shmoys |
Approximations and Randomization to Boost CSP Techniques.  |
Annals OR  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Chaitanya Swamy, Retsef Levi |
Facility location with Service Installation Costs.  |
SODA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Retsef Levi, David B. Shmoys, Chaitanya Swamy |
LP-based Approximation Algorithms for Capacitated Facility Location.  |
IPCO  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Chaitanya Swamy |
Stochastic Optimization is (Almost) as easy as Deterministic Optimization.  |
FOCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Retsef Levi, Robin Roundy, David B. Shmoys |
Primal-dual algorithms for deterministic inventory problems.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
inventory problems, approximation algorithms, primal-dual algorithms |
| 1 | Fabián A. Chudak, David B. Shmoys |
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem.  |
SIAM J. Comput.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys |
Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties.  |
ESA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Chaitanya Swamy, David B. Shmoys |
Fault-tolerant facility location.  |
SODA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Carla P. Gomes, Rommel G. Regis, David B. Shmoys |
An improved approximation algorithm for the partial latin square extension problem.  |
SODA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys |
A Constant-Factor Approximation Algorithm for the k-Median Problem.  |
J. Comput. Syst. Sci.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys (eds.) |
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA.  |
SODA  |
2000 |
DBLP BibTeX RDF |
|
| 1 | David B. Shmoys |
Approximation algorithms for facility location problems.  |
APPROX  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Karen Aardal, Fabián A. Chudak, David B. Shmoys |
A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem.  |
Inf. Process. Lett.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabián A. Chudak, David B. Shmoys |
Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds.  |
J. Algorithms  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabián A. Chudak, David B. Shmoys |
Improved Approximation Algorithms for a Capacitated Facility Location Problem.  |
SODA  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys |
Approximation Algorithms for Clustering Problems.  |
COLT  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys |
A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract).  |
STOC  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein |
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem.  |
J. Comb. Optim.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys |
Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems.  |
APPROX  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Condon, Faith 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 |
Strategic directions in research in theory of computing.  |
SIGACT News  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabián A. Chudak, David B. Shmoys |
Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract).  |
SODA  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Éva Tardos, Karen Aardal |
Approximation Algorithms for Facility Location Problems (Extended Abstract).  |
STOC  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie A. Hall, David B. Shmoys, Joel Wein |
Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms.  |
SODA  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein |
Improved Scheduling Algorithms for Minsum Criteria.  |
ICALP  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Martin, David B. Shmoys |
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem.  |
IPCO  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Joel Wein, David P. Williamson |
Scheduling Parallel Machines On-Line.  |
SIAM J. Comput.  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Clifford Stein, Joel Wein |
Improved Approximation Algorithms for Shop Scheduling Problems.  |
SIAM J. Comput.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson |
Improved Approximation Algorithms for Network Design Problems.  |
SODA  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Éva Tardos |
An approximation algorithm for the generalized assignment problem.  |
Math. Program.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Éva Tardos |
Scheduling Unrelated Machines with Costs.  |
SODA  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos |
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems.  |
SIAM J. Comput.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | David B. Shmoys, Clifford Stein, Joel Wein |
Improved Approximation Algorithms for Shop Scheduling Problems.  |
SODA  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge A. Plotkin, David B. Shmoys, Éva Tardos |
Fast Approximation Algorithms for Fractional Packing and Covering Problems  |
FOCS  |
1991 |
DBLP DOI BibTeX RDF |
fractional covering, fractional packing, approximation algorithms, linear programming, Lagrangian relaxation, running time, multicommodity flow problems |
| 1 | David B. Shmoys, Joel Wein, David P. Williamson |
Scheduling Parallel Machines On-Line  |
FOCS  |
1991 |
DBLP DOI BibTeX RDF |
information-theoretic lower bounds, algorithmic techniques, parallel machines, polynomial-time algorithms, online scheduling |
| 1 | David B. Shmoys, David P. Williamson |
Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application.  |
Inf. Process. Lett.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Karel Lenstra, David B. Shmoys, Éva Tardos |
Approximation Algorithms for Scheduling Unrelated Parallel Machines.  |
Math. Program.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer |
Flipping Persuasively in Constant Time.  |
SIAM J. Comput.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie A. Hall, David B. Shmoys |
Near-Optimal Sequencing with Precedence Constraints.  |
IPCO  |
1990 |
DBLP BibTeX RDF |
|
| 1 | Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys |
The Parallel Complexity of TSP Heuristics.  |
J. Algorithms  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Michael Merritt, David B. Shmoys |
Simple constant-time consensus protocols in realistic failure models.  |
J. ACM  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie A. Hall, David B. Shmoys |
Approximation Schemes for Constrained Scheduling Problems  |
FOCS  |
1989 |
DBLP DOI BibTeX RDF |
precedence-constrained scheduling problems, single machine problem, constrained scheduling problems, maximum completion time, two-machine flow shop, parallel-machine problem, minimisation, polynomial approximation, release dates, outline, maximum lateness |
| 1 | Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos |
Interior-Point Methods in Parallel Computation  |
FOCS  |
1989 |
DBLP DOI BibTeX RDF |
bipartite matching problem, parallel algorithm, linear programming, interior-point methods |
| 1 | Dorit S. Hochbaum, David B. Shmoys |
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach.  |
SIAM J. Comput.  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, David B. Shmoys |
Efficient Parallel Algorithms for Edge Coloring Problems.  |
J. Algorithms  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, David B. Shmoys |
Using dual approximation algorithms for scheduling problems theoretical and practical results.  |
J. ACM  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Karel Lenstra, David B. Shmoys, Éva Tardos |
Approximation Algorithms for Scheduling Unrelated Parallel Machines  |
FOCS  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, Takao Nishizeki, David B. Shmoys |
A Better than "Best Possible" Algorithm to Edge Color Multigraphs.  |
J. Algorithms  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, David B. Shmoys |
A unified approach to approximation algorithms for bottleneck problems.  |
J. ACM  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer |
Flipping Persuasively in Constant Expected Time (Preliminary Version)  |
FOCS  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, David B. Shmoys |
A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach.  |
FSTTCS  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Chor, Michael Merritt, David B. Shmoys |
Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract).  |
PODC  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, David B. Shmoys |
Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results  |
FOCS  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, David B. Shmoys |
Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems  |
STOC  |
1984 |
DBLP DOI BibTeX RDF |
|