Approximation Algorithms
EILqAmzKgYIC
380
By:"Vijay V. Vazirani"
"Computers"
Published on 2002-12-05 by Springer Science & Business Media
This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems.
READ NOW
Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.
This Book was ranked 3 by Google Books for keyword algorithms.
The book is written in enfor NOT_MATURE
Read Ebook Now
false
true
Printed Version of this book available in
BOOK
Availability of Ebook version is falsein falseor true
Public Domain Status false
Rating 4.0 by 4
SAMPLE
false
To Get More Computer Engineering Ebooks Click Here
Tidak ada komentar:
Posting Komentar