.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Texts in Theoretical Computer Science. An EATCS Series)
Juraj Hromkovic
€ 86.10
FREE Delivery in Ireland
Description for Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Texts in Theoretical Computer Science. An EATCS Series)
Paperback. Series: Texts in Theoretical Computer Science: An EATCS Series. Num Pages: 538 pages, biography. BIC Classification: UMB. Category: (P) Professional & Vocational. Dimension: 166 x 237 x 30. Weight in Grams: 792.
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design of algorithms for hard computing tasks, and that systematically ... Read more
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design of algorithms for hard computing tasks, and that systematically ... Read more
Product Details
Format
Paperback
Publication date
2010
Publisher
Springer
Condition
New
Series
Texts in Theoretical Computer Science: An EATCS Series
Number of Pages
538
Place of Publication
Berlin, Germany
ISBN
9783642079092
SKU
V9783642079092
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (Texts in Theoretical Computer Science. An EATCS Series)