Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics - Juraj Hromkovi¿

inglise keel
2010-12-09
75,06 € 107,23 €

-30% koodiga BOOKS

Meie tarnija laos

Saadetis 12-18 tööpäeva jooksul

30-päevane tagastamisõigus

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 s ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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 explains, combines, and compares the main possibilities for attacking hard algorithmic problems. As this topic is fundamental for computer science, this book tries to close this gap. Another motivation, and probably the main reason for writing this book, is connected to education. The considered area has developed very dynami­ cally in recent years and the research on this topic discovered several profound results, new concepts, and new methods. Some of the achieved contributions are so fundamental that one can speak about paradigms which should be in­ cluded in the education of every computer science student. Unfortunately, this is very far from reality. This is because these paradigms are not sufficiently known in the computer science community, and so they are insufficiently com­ municated to students and practitioners.

Lisateave

Autor Juraj Hromkovi¿
Kirjastaja Springer Berlin Heidelberg
Series Texts in Theoretical Computer Science. An EATCS Series
Väljalaskeaasta 2010
Kaanetüüp Pehme kaanega
EAN 9783642079092
Kirjuta oma arvustus
Te vaatate: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Teie hinnang:

Goodreads'i arvustused

75,06 € 107,23 €