Design and Analysis of Approximation Algorithms

Design and Analysis of Approximation Algorithms
Author :
Publisher : Springer Science & Business Media
Total Pages : 450
Release :
ISBN-10 : 9781461417019
ISBN-13 : 1461417015
Rating : 4/5 (19 Downloads)

Book Synopsis Design and Analysis of Approximation Algorithms by : Ding-Zhu Du

Download or read book Design and Analysis of Approximation Algorithms written by Ding-Zhu Du and published by Springer Science & Business Media. This book was released on 2011-11-18 with total page 450 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


Design and Analysis of Approximation Algorithms Related Books

Design and Analysis of Approximation Algorithms
Language: en
Pages: 450
Authors: Ding-Zhu Du
Categories: Mathematics
Type: BOOK - Published: 2011-11-18 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

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 research
Combinatorial Optimization and Graph Algorithms
Language: en
Pages: 126
Authors: Takuro Fukunaga
Categories: Computers
Type: BOOK - Published: 2017-10-02 - Publisher: Springer

DOWNLOAD EBOOK

Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses
Stable Marriage and Its Relation to Other Combinatorial Problems
Language: en
Pages: 90
Authors: Donald Ervin Knuth
Categories: Mathematics
Type: BOOK - Published: 1997 - Publisher: American Mathematical Soc.

DOWNLOAD EBOOK

Uses the theory of stable marriage to introduce and illustrate a variety of important concepts and techniques of computer science and mathematics: data structur
Combinatorial Optimization
Language: en
Pages: 596
Authors: Bernhard Korte
Categories: Mathematics
Type: BOOK - Published: 2006-01-27 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast
Stochastic Local Search
Language: en
Pages: 678
Authors: Holger H. Hoos
Categories: Business & Economics
Type: BOOK - Published: 2005 - Publisher: Morgan Kaufmann

DOWNLOAD EBOOK

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems. Offering a syste