The Design of Approximation Algorithms
Title | The Design of Approximation Algorithms PDF eBook |
Author | David P. Williamson |
Publisher | Cambridge University Press |
Pages | 518 |
Release | 2011-04-26 |
Genre | Computers |
ISBN | 9780521195270 |
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 NP-hard. 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 near-optimal 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 graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.
The Design of Approximation Algorithms
Title | The Design of Approximation Algorithms PDF eBook |
Author | David P. Williamson |
Publisher | |
Pages | 518 |
Release | 2014-05-14 |
Genre | Approximation theory |
ISBN | 9781139077750 |
Designed as a textbook for graduate courses on algorithms, this book presents efficient algorithms that find provably near-optimal solutions.
Approximation Algorithms
Title | Approximation Algorithms PDF eBook |
Author | Vijay V. Vazirani |
Publisher | Springer Science & Business Media |
Pages | 380 |
Release | 2013-03-14 |
Genre | Computers |
ISBN | 3662045656 |
Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.
Design and Analysis of Approximation Algorithms
Title | Design and Analysis of Approximation Algorithms PDF eBook |
Author | Ding-Zhu Du |
Publisher | Springer Science & Business Media |
Pages | 450 |
Release | 2011-11-18 |
Genre | Mathematics |
ISBN | 1461417015 |
This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way.
Geometric Approximation Algorithms
Title | Geometric Approximation Algorithms PDF eBook |
Author | Sariel Har-Peled |
Publisher | American Mathematical Soc. |
Pages | 378 |
Release | 2011 |
Genre | Computers |
ISBN | 0821849115 |
Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterparts. This book is the first to cover geometric approximation algorithms in detail. In addition, more traditional computational geometry techniques that are widely used in developing such algorithms, like sampling, linear programming, etc., are also surveyed. Other topics covered include approximate nearest-neighbor search, shape approximation, coresets, dimension reduction, and embeddings. The topics covered are relatively independent and are supplemented by exercises. Close to 200 color figures are included in the text to illustrate proofs and ideas.
Approximation Algorithms for NP-hard Problems
Title | Approximation Algorithms for NP-hard Problems PDF eBook |
Author | Dorit S. Hochbaum |
Publisher | Course Technology |
Pages | 632 |
Release | 1997 |
Genre | Computers |
ISBN |
This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leading researchers in the field, this book introduces unifying techniques in the analysis of approximation algorithms. APPROXIMATION ALGORITHMS FOR NP-HARD PROBLEMS is intended for computer scientists and operations researchers interested in specific algorithm implementations, as well as design tools for algorithms. Among the techniques discussed: the use of linear programming, primal-dual techniques in worst-case analysis, semidefinite programming, computational geometry techniques, randomized algorithms, average-case analysis, probabilistically checkable proofs and inapproximability, and the Markov Chain Monte Carlo method. The text includes a variety of pedagogical features: definitions, exercises, open problems, glossary of problems, index, and notes on how best to use the book.
Approximation and Online Algorithms
Title | Approximation and Online Algorithms PDF eBook |
Author | Evripidis Bampis |
Publisher | Springer Nature |
Pages | 253 |
Release | 2020-01-24 |
Genre | Mathematics |
ISBN | 3030394794 |
This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019. The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.