Algorithmics for Hard Problems Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Afbeeldingen
Artikel vergelijken
Auteur:
Juraj Hromkovic
- Engels
- Hardcover
- 9783540441342
- 09 oktober 2002
- 538 pagina's
Samenvatting
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies.
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.
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.
Productspecificaties
Wij vonden geen specificaties voor jouw zoekopdracht '{SEARCH}'.
Inhoud
- Taal
- en
- Bindwijze
- Hardcover
- Oorspronkelijke releasedatum
- 09 oktober 2002
- Aantal pagina's
- 538
- Illustraties
- Nee
Betrokkenen
- Hoofdauteur
- Juraj Hromkovic
- Hoofduitgeverij
- Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Overige kenmerken
- Editie
- 2
- Extra groot lettertype
- Nee
- Product breedte
- 165 mm
- Product hoogte
- 38 mm
- Product lengte
- 235 mm
- Studieboek
- Nee
- Verpakking breedte
- 165 mm
- Verpakking hoogte
- 38 mm
- Verpakking lengte
- 235 mm
- Verpakkingsgewicht
- 953 g
EAN
- EAN
- 9783540441342
Je vindt dit artikel in
- Categorieën
- Taal
- Engels
- Beschikbaarheid
- Leverbaar
- Boek, ebook of luisterboek?
- Boek
- Studieboek of algemeen
- Algemene boeken
Kies gewenste uitvoering
Kies je bindwijze
(2)
Prijsinformatie en bestellen
De prijs van dit product is 96 euro.
Uiterlijk 10 mei in huis
Verkoop door bol
- Gratis verzending door bol vanaf 20 euro
- 30 dagen bedenktijd en gratis retourneren
- Dag en nacht klantenservice
Anderen bekeken ook
Rapporteer dit artikel
Je wilt melding doen van illegale inhoud over dit artikel:
- Ik wil melding doen als klant
- Ik wil melding doen als autoriteit of trusted flagger
- Ik wil melding doen als partner
- Ik wil melding doen als merkhouder
Geen klant, autoriteit, trusted flagger, merkhouder of partner? Gebruik dan onderstaande link om melding te doen.