DATE DE PUBLICATION | 2001-Jul-10 |

AUTEUR | Vijay-V Vazirani |

ISBN | 9783540653677 |

TAILLE DU FICHIER | 3,67 MB |

The field of approximation algorithms, perhaps the most active area of algorithmic research today, combines a rich and deep mathematical theory with the promise of profound practical impact. Most computational problems arising across a very broad spectrum of application areas, such as VLSI design, design and operation of networks, web-related problems, scheduling, manufacturing, game theory, biology, and number theory, are NP-hard, hence making their exact solution prohibitively time-consuming. This challenge has motivated the growth of an impressive literature, providing approximation algorithms for this very diverse collection of problems. A slew of spectacular results in the last decade has revolutionized the field. The challenge met by this book is to capture the beauty and excitement of work in this thriving field and to convey in a lucid manner the underlying theory and methodology. Many of the research results presented have been simplified, and new insights provided Perhaps the most important aspect of the book is that it shows simple ways of talking about complex, powerful algorithmic ideas by giving intuitive proofs, by writing algorithms in plain English, and by providing numerous critical examples and illustrations. This book will be of interest to the scientific community at large and, in particular, to students and researchers in Computer Science, Operations Research, and Discrete Mathematics. It can be used both as a text in a graduate course on approximation algorithms and as a supplementary text in basic undergraduate and graduate courses on algorithms.

Téléchargez la version électronique de Approximation algorithms sur era-circus.be. Formats disponibles : Approximation algorithms PDF, Approximation algorithms ePUB, Approximation algorithms MOBI

Lecture 5: Introduction to Approximation Algorithms Many important computational problems are diﬃcult to solve optimally. In fact, many of those problems are NP-hard1, which means that no polynomial-time algorithm exists that solves the problem optimally unless P=NP. A well-known example is the Euclidean traveling salesman problem (Euclidean TSP): given a set of points in the plane, ﬁnd a ...

Introduction to Approximation Algorithms Dr. Gautam K. Das Departmet of Mathematics Indian Institute of Technology Guwahati, India [email protected] February 19, 2016. Outline of the lecture I Background I Deﬁnition of approximation algorithms I Some examples of approximation algorithms I Polynomial time approximation scheme (PTAS) I Conclusion. Optimization Problem 1.In mathematics and ...