Items related to Algorithmics for Hard Computing Problems
Synopsis
Book by Hromkovic, Juraj
"synopsis" may belong to another edition of this title.
From the Back Cover
There are several approaches to attack hard problems. All have their merits, but also their limitations, and need a large body of theory as their basis. A number of books for each one exist: books on complexity theory, others on approximation algorithms, heuristic approaches, parametrized complexity, and yet others on randomized algorithms. This book discusses thoroughly all of the above approaches. And, amazingly, at the same time, does this in a style that makes the book accessible not only to theoreticians, but also to the non-specialist, to the student or teacher, and to the programmer. Do you think that mathematical rigor and accessibility contradict? Look at this book to find out that they do not, due to the admirable talent of the author to present his material in a clear and concise way, with the idea behind the approach spelled out explicitly, often with a revealing example.
Reading this book is a beautiful experience and I can highly recommend it to anyone interested in learning how to solve hard problems. It is not just a condensed union of material from other books. Because it discusses the different approaches in depth, it has the chance to compare them in detail, and, most importantly, to highlight under what circumstances which approach might be worth exploring. No book on a single type of solution can do that, but this book does it in an absolutely fascinating way that can serve as a pattern for theory textbooks with a high level of generality. (Peter Widmayer)
The second edition extends the part on the method of relaxation to linear programming with an emphasis on rounding, LP-duality, and primal-dual schema, and provides a self-contained and transparent presentation of the design of randomized algorithms for primality testing.
"About this title" may belong to another edition of this title.
- PublisherSecaucus, New Jersey, U.S.A.: Springer Verlag
- Publication date2001
- ISBN 10 3540668608
- ISBN 13 9783540668602
- BindingHardcover
- LanguageEnglish
- Edition number1
- Number of pages492
- Rating
Search results for Algorithmics for Hard Computing Problems
Stock Image
Algorithmics for Hard Computing Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Published by
Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 2001
ISBN 10: 3540668608
ISBN 13: 9783540668602
Used
Hardcover
Seller: Ammareal, Morangis, France
Seller rating 5 out of 5 stars
Hardcover. Condition: Très bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 2001. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Edition 2001. Ammareal gives back up to 15% of this item's net price to charity organizations. Seller Inventory # E-812-953
Quantity: 1 available
Stock Image
Algorithmics for Hard Computing Problems
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_359518143
Quantity: 1 available
Stock Image
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Published by
Secaucus, New Jersey, U.S.A.: Springer Verlag, 2001
ISBN 10: 3540668608
ISBN 13: 9783540668602
Used
Hardcover
Seller: Rob the Book Man, Vancouver, WA, U.S.A.
Seller rating 4 out of 5 stars
Hardcover. Condition: Fine. Hardback in fine condition. Seller Inventory # 6481
Quantity: 1 available