The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David B. Shmoys: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein
    Improved Scheduling Algorithms for Minsum Criteria. [Citation Graph (1, 0)][DBLP]
    ICALP, 1996, pp:646-657 [Conf]
  2. David B. Shmoys, Éva Tardos, Karen Aardal
    Approximation Algorithms for Facility Location Problems (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    STOC, 1997, pp:265-274 [Conf]
  3. David B. Shmoys, Joel Wein, David P. Williamson
    Scheduling Parallel Machines On-Line. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:6, pp:1313-1331 [Journal]
  4. David B. Shmoys
    Approximation algorithms for facility location problems. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:27-33 [Conf]
  5. David B. Shmoys
    Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:15-32 [Conf]
  6. David B. Shmoys
    Approximation Algorithms for Clustering Problems. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:100-102 [Conf]
  7. Chaitanya Swamy, David B. Shmoys
    Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  8. Aaron Archer, Ranjithkumar Rajagopalan, David B. Shmoys
    Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:31-42 [Conf]
  9. Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer
    Flipping Persuasively in Constant Expected Time (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:222-232 [Conf]
  10. Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos
    Interior-Point Methods in Parallel Computation [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:350-355 [Conf]
  11. Leslie A. Hall, David B. Shmoys
    Approximation Schemes for Constrained Scheduling Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:134-139 [Conf]
  12. Dorit S. Hochbaum, David B. Shmoys
    Using Dual Approximation Algorithms for Scheduling Problems: Theoretical and Practical Results [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:79-89 [Conf]
  13. Jan Karel Lenstra, David B. Shmoys, Éva Tardos
    Approximation Algorithms for Scheduling Unrelated Parallel Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:217-224 [Conf]
  14. Serge A. Plotkin, David B. Shmoys, Éva Tardos
    Fast Approximation Algorithms for Fractional Packing and Covering Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:495-504 [Conf]
  15. David B. Shmoys, Chaitanya Swamy
    Stochastic Optimization is (Almost) as easy as Deterministic Optimization. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:228-237 [Conf]
  16. David B. Shmoys, Joel Wein, David P. Williamson
    Scheduling Parallel Machines On-Line [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:131-140 [Conf]
  17. Chaitanya Swamy, David B. Shmoys
    Sampling-based Approximation Algorithms for Multi-stage Stochastic. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:357-366 [Conf]
  18. Dorit S. Hochbaum, David B. Shmoys
    A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:382-393 [Conf]
  19. Chaitanya Swamy, David B. Shmoys
    Approximation Algorithms for 2-Stage Stochastic Optimization Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:5-19 [Conf]
  20. Leslie A. Hall, David B. Shmoys
    Near-Optimal Sequencing with Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:249-260 [Conf]
  21. Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys
    Inventory and Facility Location Models with Market Selection. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:111-124 [Conf]
  22. Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys
    Approximation Algorithms for Stochastic Inventory Control Models. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:306-320 [Conf]
  23. Retsef Levi, David B. Shmoys, Chaitanya Swamy
    LP-based Approximation Algorithms for Capacitated Facility Location. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:206-218 [Conf]
  24. Paul Martin, David B. Shmoys
    A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:389-403 [Conf]
  25. Benny Chor, Michael Merritt, David B. Shmoys
    Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:152-162 [Conf]
  26. Fabián A. Chudak, David B. Shmoys
    Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:581-590 [Conf]
  27. Fabián A. Chudak, David B. Shmoys
    Improved Approximation Algorithms for a Capacitated Facility Location Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:875-876 [Conf]
  28. Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin, David B. Shmoys, Éva Tardos, David P. Williamson
    Improved Approximation Algorithms for Network Design Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:223-232 [Conf]
  29. Carla P. Gomes, Rommel G. Regis, David B. Shmoys
    An improved approximation algorithm for the partial latin square extension problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:832-833 [Conf]
  30. Leslie A. Hall, David B. Shmoys, Joel Wein
    Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:142-151 [Conf]
  31. Retsef Levi, Robin Roundy, David B. Shmoys
    A constant approximation algorithm for the one-warehouse multi-retailer problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:365-374 [Conf]
  32. David B. Shmoys, Chaitanya Swamy, Retsef Levi
    Facility location with Service Installation Costs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1088-1097 [Conf]
  33. David B. Shmoys, Clifford Stein, Joel Wein
    Improved Approximation Algorithms for Shop Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:148-157 [Conf]
  34. David B. Shmoys, Éva Tardos
    Scheduling Unrelated Machines with Costs. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:448-454 [Conf]
  35. Chaitanya Swamy, David B. Shmoys
    Fault-tolerant facility location. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:735-736 [Conf]
  36. Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
    A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:1-10 [Conf]
  37. Dorit S. Hochbaum, David B. Shmoys
    Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:324-333 [Conf]
  38. Retsef Levi, Robin Roundy, David B. Shmoys
    Primal-dual algorithms for deterministic inventory problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:353-362 [Conf]
  39. Retsef Levi, Robin Roundy, David B. Shmoys
    Provably near-optimal sampling-based algorithms for Stochastic inventory control models. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:739-748 [Conf]
  40. Karen Aardal, Fabián A. Chudak, David B. Shmoys
    A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:5-6, pp:161-167 [Journal]
  41. David B. Shmoys, David P. Williamson
    Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:6, pp:281-285 [Journal]
  42. Benny Chor, Michael Merritt, David B. Shmoys
    Simple constant-time consensus protocols in realistic failure models. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:3, pp:591-614 [Journal]
  43. Dorit S. Hochbaum, David B. Shmoys
    A unified approach to approximation algorithms for bottleneck problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:3, pp:533-550 [Journal]
  44. Dorit S. Hochbaum, David B. Shmoys
    Using dual approximation algorithms for scheduling problems theoretical and practical results. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:1, pp:144-162 [Journal]
  45. David B. Shmoys, Chaitanya Swamy
    An approximation scheme for stochastic linear programming and its application to stochastic integer programs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:6, pp:978-1012 [Journal]
  46. Fabián A. Chudak, David B. Shmoys
    Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:30, n:2, pp:323-343 [Journal]
  47. Dorit S. Hochbaum, Takao Nishizeki, David B. Shmoys
    A Better than "Best Possible" Algorithm to Edge Color Multigraphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:1, pp:79-104 [Journal]
  48. Howard J. Karloff, David B. Shmoys
    Efficient Parallel Algorithms for Edge Coloring Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:1, pp:39-52 [Journal]
  49. Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys
    The Parallel Complexity of TSP Heuristics. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:2, pp:249-270 [Journal]
  50. David B. Shmoys
    Foreword. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:2, pp:133- [Journal]
  51. Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein
    Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:1, n:4, pp:413-426 [Journal]
  52. Moses Charikar, Sudipto Guha, Éva Tardos, David B. Shmoys
    A Constant-Factor Approximation Algorithm for the k-Median Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:1, pp:129-149 [Journal]
  53. Jan Karel Lenstra, David B. Shmoys, Éva Tardos
    Approximation Algorithms for Scheduling Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:259-271 [Journal]
  54. David B. Shmoys, Éva Tardos
    An approximation algorithm for the generalized assignment problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:461-474 [Journal]
  55. Carla P. Gomes, Rommel G. Regis, David B. Shmoys
    An improved approximation algorithm for the partial Latin square extension problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:5, pp:479-484 [Journal]
  56. Fabián A. Chudak, David B. Shmoys
    Improved Approximation Algorithms for the Uncapacitated Facility Location Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:33, n:1, pp:1-25 [Journal]
  57. Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer
    Flipping Persuasively in Constant Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:472-499 [Journal]
  58. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:140-150 [Journal]
  59. Dorit S. Hochbaum, David B. Shmoys
    A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:3, pp:539-551 [Journal]
  60. David B. Shmoys, Clifford Stein, Joel Wein
    Improved Approximation Algorithms for Shop Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:3, pp:617-632 [Journal]
  61. David B. Shmoys, Mauro Sozio
    Approximation Algorithms for 2-Stage Stochastic Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:145-157 [Conf]

  62. Improved Lower Bounds for the Universal and a priori TSP. [Citation Graph (, )][DBLP]


  63. Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. [Citation Graph (, )][DBLP]


  64. Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization. [Citation Graph (, )][DBLP]


  65. Primal-Dual Schema for Capacitated Covering Problems. [Citation Graph (, )][DBLP]


  66. A Constant Approximation Algorithm for the a prioriTraveling Salesman Problem. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002