Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics Hardcover - 2003
by HROMKOVIC, Juraj
- Used
- Good
- Hardcover
Description
Standard delivery: 7 to 14 days
Details
- Title Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
- Author HROMKOVIC, Juraj
- Binding Hardcover
- Edition Second Edition
- Condition Used - Good
- Pages 538
- Volumes 1
- Language ENG
- Publisher Springer, Bath
- Date 2003
- Bookseller's Inventory # 133808
- ISBN 9783540441342 / 3540441344
- Weight 2.02 lbs (0.92 kg)
- Dimensions 9.56 x 6.42 x 1.36 in (24.28 x 16.31 x 3.45 cm)
- Library of Congress Catalog Number 2002032405
- Dewey Decimal Code 004.6
About Attic Books Ontario, Canada
Attic Books is one of the premier retail locations for antiquarian and collectable books in Canada. We recently celebrated our thirtieth year in business. Please browse our select online stock on a wide range of subjects in books and paper collectables for the reader, scholar and the seasoned collector. Or come visit us in London, Ontario to enjoy the relaxed atmosphere of our three floor bookstore, enhanced by original tin ceilings, hardwood maple floors, and the arts & crafts fa�ade of our century building.
30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.
From the publisher
First line
From the rear cover
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.