Design and Analysis of Approximation Algorithms by Ding-Zhu Du

Page Updated:
Book Views: 17

Author
Ding-Zhu Du
Publisher
Springer
Date of release
Pages
440
ISBN
9781461417002
Binding
Hardcover
Illustrations
Format
PDF, EPUB, MOBI, TXT, DOC
Rating
4
74

Advertising

Get eBOOK
Design and Analysis of Approximation Algorithms

Find and Download Book

Click one of share button to proceed download:
Choose server for download:
Download
Get It!
File size:2 mb
Estimated time:4 min
If not downloading or you getting an error:
  • Try another server.
  • Try to reload page — press F5 on keyboard.
  • Clear browser cache.
  • Clear browser cookies.
  • Try other browser.
  • If you still getting an error — please contact us and we will fix this error ASAP.
Sorry for inconvenience!
For authors or copyright holders
Amazon Affiliate

Go to Removal form

Leave a comment

Book review

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.


Readers reviews