Design and Analysis of Approximation Algorithms by Ding-Zhu Du (.PDF)
File Size: 3 MB
Design and Analysis of Approximation Algorithms (Springer Optimization and Its Applications Book 62) by Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
Requirements: .PDF reader, 3 MB
Overview: 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.
Genre: Non-Fiction > Tech & Devices
Free Download links: