Shmoys, David Bernard
Overview
Works:  50 works in 101 publications in 2 languages and 1,073 library holdings 

Genres:  Conference papers and proceedings Academic theses 
Roles:  Author, Editor, Thesis advisor 
Classifications:  QA164, 511.6 
Publication Timeline
.
Most widely held works by
David Bernard Shmoys
The design of approximation algorithms by
David P Williamson(
)
17 editions published between 2011 and 2012 in English and held by 819 WorldCat member libraries worldwide
"Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NPhard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably nearoptimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduatelevel algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems"
17 editions published between 2011 and 2012 in English and held by 819 WorldCat member libraries worldwide
"Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NPhard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably nearoptimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduatelevel algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems"
The Traveling salesman problem : a guided tour of combinatorial optimization by
Eugene L Lawler(
Book
)
8 editions published between 1985 and 1997 in English and held by 60 WorldCat member libraries worldwide
Provides an indepth treatment of the Traveling Salesman problemthe archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a selfcontained manner. Includes exercises and an extensive bibliography.
8 editions published between 1985 and 1997 in English and held by 60 WorldCat member libraries worldwide
Provides an indepth treatment of the Traveling Salesman problemthe archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a selfcontained manner. Includes exercises and an extensive bibliography.
Proceedings of the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms by
David Bernard Shmoys(
)
5 editions published in 2000 in English and held by 40 WorldCat member libraries worldwide
This symposium concerns research on the use, design, and analysis of efficient algorithms and data structures, and on the mathematical problems related to the development and analysis of discrete algorithms
5 editions published in 2000 in English and held by 40 WorldCat member libraries worldwide
This symposium concerns research on the use, design, and analysis of efficient algorithms and data structures, and on the mathematical problems related to the development and analysis of discrete algorithms
Proceedings of the fortysixth annual ACM symposium on Theory of computing by
David Bernard Shmoys(
)
1 edition published in 2014 in English and held by 18 WorldCat member libraries worldwide
1 edition published in 2014 in English and held by 18 WorldCat member libraries worldwide
Sampling based approximation algorithms for multistage stochastic optimization(
)
1 edition published in 2007 in English and held by 16 WorldCat member libraries worldwide
1 edition published in 2007 in English and held by 16 WorldCat member libraries worldwide
Approximation algorithms for 2stage and multistage stochastic optimization by
Chaitanya Swamy(
)
1 edition published in 2005 in English and held by 14 WorldCat member libraries worldwide
1 edition published in 2005 in English and held by 14 WorldCat member libraries worldwide
Interiorpoint methods in parallel computation by
Andrew V Goldberg(
Book
)
3 editions published in 1989 in English and held by 13 WorldCat member libraries worldwide
Ln this paper we use interiorpoint methods for linear programing, developed in the context of sequential computation, to obtain a parallel algorithm for the bipartite matching problem. Our algorithm runs in $O[superscript]n$(SQRT m) time. Our results extend to the weighted bipartite matching problem and to the zeroone minimumcost flow problem, yielding $O[superscript]n$((SQRT m) log C) algorithms. This improves previous bounds on these problems and illustrates the importance of interiorpoint methods in the context of parallel algorithm design
3 editions published in 1989 in English and held by 13 WorldCat member libraries worldwide
Ln this paper we use interiorpoint methods for linear programing, developed in the context of sequential computation, to obtain a parallel algorithm for the bipartite matching problem. Our algorithm runs in $O[superscript]n$(SQRT m) time. Our results extend to the weighted bipartite matching problem and to the zeroone minimumcost flow problem, yielding $O[superscript]n$((SQRT m) log C) algorithms. This improves previous bounds on these problems and illustrates the importance of interiorpoint methods in the context of parallel algorithm design
Fast approximation algorithms for fractional packing and covering problems by
Serge A Plotkin(
Book
)
2 editions published in 1992 in English and held by 10 WorldCat member libraries worldwide
Abstract: "This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed in this paper greatly outperform the general methods in many applications, and are extensions of a method previously applied to find approximate solutions to multicommodity flow problems [23, 15, 18]. Our algorithm is a Lagrangean relaxation technique; an important aspect of our results is that we obtain a theoretical analysis of the running time of a Lagrangean relaxationbased algorithm
2 editions published in 1992 in English and held by 10 WorldCat member libraries worldwide
Abstract: "This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed in this paper greatly outperform the general methods in many applications, and are extensions of a method previously applied to find approximate solutions to multicommodity flow problems [23, 15, 18]. Our algorithm is a Lagrangean relaxation technique; an important aspect of our results is that we obtain a theoretical analysis of the running time of a Lagrangean relaxationbased algorithm
Approximation algorithms for scheduling unrelated parallel machines by
J. K Lenstra(
Book
)
6 editions published in 1987 in English and held by 8 WorldCat member libraries worldwide
6 editions published in 1987 in English and held by 8 WorldCat member libraries worldwide
The cryptographic security of the sum of bits by
Richard H Berger(
Book
)
2 editions published in 1984 in English and held by 5 WorldCat member libraries worldwide
We show that if there exists a deterministic oracle that can determine the sum of the bits in the binary representation of x when presented with the RSA encryption of x, then there exists a probabilistic algorithm using this oracle to recover x when presented with the RSA encryption of x. We present a similar result for Rabin encryption
2 editions published in 1984 in English and held by 5 WorldCat member libraries worldwide
We show that if there exists a deterministic oracle that can determine the sum of the bits in the binary representation of x when presented with the RSA encryption of x, then there exists a probabilistic algorithm using this oracle to recover x when presented with the RSA encryption of x. We present a similar result for Rabin encryption
Approximation algorithms by
Andreas S Schulz(
Book
)
4 editions published in 1997 in English and Undetermined and held by 5 WorldCat member libraries worldwide
4 editions published in 1997 in English and Undetermined and held by 5 WorldCat member libraries worldwide
Wellsolved special cases of the traveling salesman problem by
Paul C Gilmore(
Book
)
3 editions published in 1984 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 1984 in English and held by 5 WorldCat member libraries worldwide
Approximation algorithms for facility location problems by
David Bernard Shmoys(
Book
)
4 editions published in 1997 in English and held by 4 WorldCat member libraries worldwide
4 editions published in 1997 in English and held by 4 WorldCat member libraries worldwide
Kinji arugorizumu dezain by
David P Williamson(
Book
)
2 editions published in 2015 in Japanese and held by 4 WorldCat member libraries worldwide
2 editions published in 2015 in Japanese and held by 4 WorldCat member libraries worldwide
Approximation algorithms for problems in sequencing, scheduling, and communication network design by
David Bernard Shmoys(
)
2 editions published in 1984 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1984 in English and held by 4 WorldCat member libraries worldwide
SODA 2000 special issue: [seven selected papers from the Eleventh Annual ACMSIAM Symposium on Discrete Algorithms (SODA)
held January 911, 2000 in San Francisco] by
2000, San Francisco, Calif.> Symposium on Discrete Algorithms. <11(
Book
)
3 editions published in 2004 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 2004 in English and held by 4 WorldCat member libraries worldwide
Approximation and heuristics by D Johnson(
Book
)
1 edition published in 2005 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 2005 in English and held by 3 WorldCat member libraries worldwide
Combinatorial Approximation Algorithms by
Yuval Rabani(
Book
)
2 editions published in 1998 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1998 in English and held by 2 WorldCat member libraries worldwide
Cut problems and their application to divideandconquer by
David Bernard Shmoys(
)
1 edition published in 1997 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1997 in English and held by 2 WorldCat member libraries worldwide
Computational approaches for hard discrete optimization problems by Daniel Fleischman(
)
1 edition published in 2016 in English and held by 1 WorldCat member library worldwide
1 edition published in 2016 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Williamson, David P. Author
 Lenstra, J. K. Author Editor
 Lawler, Eugene L. Honoree Author Editor
 Rinnooy Kan, A. H. G. 1949 Editor
 Association for Computing MachineryDigital Library
 Tardos, Éva
 Swamy, Chaitanya Author
 ACM Special Interest Group on Algorithms and Computation Theory
 Plotkin, Serge A. Author
 Association for Computing Machinery
Useful Links
Associated Subjects
Algorithms Approximation algorithms Approximation theory Combinations Combinatorial analysis Combinatorial optimization Computer algorithms Computer programming Computer science Interiorpoint methods Linear programming Matching theory Mathematical optimization Operations research Parallel algorithms Sequential processing (Computer science) Traveling salesman problem
Covers
Alternative Names
David Bernard Shmoys Amerikaans wiskundige
David Shmoys matemàtic estatunidenc
David Shmoys matemático estadounidense
David Shmoys matematico statunitense
David Shmoys mathématicien américain
David Shmoys USamerikanischer Mathematiker
Shmoys, D. 1959
Shmoys, D. B.
Shmoys, D. B. 1959
Shmoys, David 1959
Shmoys, David B.
Shmoys, David B. 1959
Languages