Full Product Details
Author: Vijay V. Vazirani
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition: Softcover reprint of hardcover 1st ed. 2001
Dimensions:
Width: 15.50cm
, Height: 2.00cm
, Length: 23.50cm
Weight: 0.617kg
ISBN: 9783642084690
ISBN 10: 3642084699
Pages: 380
Publication Date: 08 December 2010
Audience:
Professional and scholarly
,
Professional and scholarly
,
Professional & Vocational
,
Postgraduate, Research & Scholarly
Format: Paperback
Publisher's Status: Active
Availability: In Print
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.
Reviews
"From the reviews: ""Approximation algorithms is an area where much progress has been made in the last 10 years. The book under review is a very good help for understanding these results. In each of the 27 chapters an important combinatorial optimization problem is presented and one or more approximation algorithms for it are clearly and concisely described and analyzed. In this way most of the most important results from the approximation algorithm literature are covered, often more easily comprehensible than the original articles."" (Viggo Kann, Zentralblatt MATH, Vol. 1005, 2003) ""The book under review concentrates on the … design and analysis of efficient approximation algorithms with good performance guarantees. It is possibly the first textbook to provide an extensive and systematic coverage of this topic. … The book starts briskly, using simple examples to illustrate some of the key concepts and draw the reader rapidly in. … Copious exercises are included to test and deepen the reader’s understanding. … It deserves a place in every computer science and mathematical library."" (Mark R. Jerrum, Mathematical Reviews, 2002 h) ""The book of Vijay Vazirani is not the first one dedicated to approximation algorithms … . However it is, I believe, among the very best from a didactical point of view: this is the text I would chose, would I have to give a course on approximation algorithms … . I suspect that for many researchers it would be the first one to consult … . It is a must acquisition for libraries of computer science/engineering departments … ."" (Francesco Maffioli, Mathematical Methods of Operations Research, Vol. 56 (2), 2002) ""The book gives an overview on the theory of approximation algorithms. It presents the most important problems, the basic methods and ideas which are used in this area. … The book can be used for a graduate course on approximation algorithms. … The chapters also contain asection of exercises, which can help the students to understand the material in a deeper way. … On the other hand the book can be used by the researchers of the field … ."" (Csanád Imreh, Acta Scientiarum Mathematicarum, Vol. 68, 2002)"
From the reviews: Approximation algorithms is an area where much progress has been made in the last 10 years. The book under review is a very good help for understanding these results. In each of the 27 chapters an important combinatorial optimization problem is presented and one or more approximation algorithms for it are clearly and concisely described and analyzed. In this way most of the most important results from the approximation algorithm literature are covered, often more easily comprehensible than the original articles. (Viggo Kann, Zentralblatt MATH, Vol. 1005, 2003) The book under review concentrates on the ... design and analysis of efficient approximation algorithms with good performance guarantees. It is possibly the first textbook to provide an extensive and systematic coverage of this topic. ... The book starts briskly, using simple examples to illustrate some of the key concepts and draw the reader rapidly in. ... Copious exercises are included to test and deepen the reader's understanding. ... It deserves a place in every computer science and mathematical library. (Mark R. Jerrum, Mathematical Reviews, 2002 h) The book of Vijay Vazirani is not the first one dedicated to approximation algorithms ... . However it is, I believe, among the very best from a didactical point of view: this is the text I would chose, would I have to give a course on approximation algorithms ... . I suspect that for many researchers it would be the first one to consult ... . It is a must acquisition for libraries of computer science/engineering departments ... . (Francesco Maffioli, Mathematical Methods of Operations Research, Vol. 56 (2), 2002) The book gives an overview on the theory of approximation algorithms. It presents the most important problems, the basic methods and ideas which are used in this area. ... The book can be used for a graduate course on approximation algorithms. ... The chapters also contain a section of exercises, which can help the students to understand the material in a deeper way. ... On the other hand the book can be used by the researchers of the field ... . (Csanad Imreh, Acta Scientiarum Mathematicarum, Vol. 68, 2002)
From the reviews: Approximation algorithms is an area where much progress has been made in the last 10 years. The book under review is a very good help for understanding these results. In each of the 27 chapters an important combinatorial optimization problem is presented and one or more approximation algorithms for it are clearly and concisely described and analyzed. In this way most of the most important results from the approximation algorithm literature are covered, often more easily comprehensible than the original articles. (Viggo Kann, Zentralblatt MATH, Vol. 1005, 2003) The book under review concentrates on the ! design and analysis of efficient approximation algorithms with good performance guarantees. It is possibly the first textbook to provide an extensive and systematic coverage of this topic. ! The book starts briskly, using simple examples to illustrate some of the key concepts and draw the reader rapidly in. ! Copious exercises are included to test and deepen the reader's understanding. ! It deserves a place in every computer science and mathematical library. (Mark R. Jerrum, Mathematical Reviews, 2002 h) The book of Vijay Vazirani is not the first one dedicated to approximation algorithms ! . However it is, I believe, among the very best from a didactical point of view: this is the text I would chose, would I have to give a course on approximation algorithms ! . I suspect that for many researchers it would be the first one to consult ! . It is a must acquisition for libraries of computer science/engineering departments ! . (Francesco Maffioli, Mathematical Methods of Operations Research, Vol. 56 (2), 2002) The book gives an overview on the theory of approximation algorithms. It presents the most important problems, the basic methods and ideas which are used in this area. ! The book can be used for a graduate course on approximation algorithms. ! The chapters also contain a section of exercises, which can help the students to understand the material in a deeper way. ! On the other hand the book can be used by the researchers of the field ! . (Csanad Imreh, Acta Scientiarum Mathematicarum, Vol. 68, 2002)
