Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 556 pp. Englisch. N� de r�f. du vendeur 9783642079092

Contacter le vendeur

Acheter neuf

EUR 69,54

Autre devise

Frais de port : EUR 23

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Algorithmics for Hard Problems : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics

Juraj Hromkovi�

Edit� par Springer Berlin Heidelberg, 2010

ISBN 10 : 3642079091 ISBN 13 : 9783642079092

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N� de r�f. du vendeur 9783642079092

Contacter le vendeur

Acheter neuf

EUR 69,54

Autre devise

Frais de port : EUR 32,15

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Algorithmics for Hard Problems

Juraj Hromkovic

Edit� par Springer Berlin Heidelberg, 2010

ISBN 10 : 3642079091 ISBN 13 : 9783642079092

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A textbook as well as a handbook on the kernel of current algorithmics With many examples to support the understandingAlgorithmic design, especially for hard problems, is more essential for success in solving them than any standard improve. N� de r�f. du vendeur 5046964

Contacter le vendeur

Acheter neuf

EUR 60,06

Autre devise

Frais de port : EUR 48,99

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Articles li�s � Algorithmics for Hard Problems: Introduction to Combinatoria...

Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics - Couverture souple

Acheter D'occasion

Acheter neuf

Autres �ditions populaires du m�me titre

Edition pr�sent�e

R�sultats de recherche pour Algorithmics for Hard Problems: Introduction to Combinatoria...

Acheter neuf

Acheter neuf

Acheter D'occasion

Acheter neuf

Acheter neuf

Acheter neuf

Acheter D'occasion

Acheter neuf

Acheter neuf

Acheter neuf