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 (015 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

GET 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
The Design of Approximation Algorithms
Language: en
Pages: 518
Authors: David P. Williamson
Categories: Computers
Type: BOOK - Published: 2011-04-26 - Publisher: Cambridge University Press

GET EBOOK

Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design
Approximation Algorithms
Language: en
Pages: 380
Authors: Vijay V. Vazirani
Categories: Computers
Type: BOOK - Published: 2013-03-14 - Publisher: Springer Science & Business Media

GET EBOOK

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results,
Design and Analysis of Algorithms
Language: en
Pages: 395
Authors: Sandeep Sen
Categories: Computers
Type: BOOK - Published: 2019-05-23 - Publisher: Cambridge University Press

GET EBOOK

Focuses on the interplay between algorithm design and the underlying computational models.
Approximation and Optimization
Language: en
Pages: 244
Authors: Ioannis C. Demetriou
Categories: Mathematics
Type: BOOK - Published: 2019-05-10 - Publisher: Springer

GET EBOOK

This book focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are written by leading expert