Algorithmics hard problems introduction par hromkovic juraj (18 résultats)

Etat : Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.…

Etat : New.

Hardcover. Etat : Wie neu. Bln., Springer (2001). gr.8°. 64 figs. XI, 492 p. Hardbound. Texts in Theoretical Computer Sciences. An EATCS Series.- Incl. bibliography.- Like new.

Etat : As New. Unread book in perfect condition.

Hardcover. Etat : Good. Second Edition. xiii, 544 p. 24 cm. 71 figures. Stain on front cover. Ink signature on front free endpaper. A little dust on text block edge. A few wrinkles to some front pages.

Etat : Poor. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In poor condition, suitable as a reading copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,950grams, ISBN:9783540668602.…

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New.

Etat : Sehr gut. Zustand: Sehr gut | Seiten: 505 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Etat : New.

Buch. Etat : Neu. 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.…

Hardcover. Etat : gut. 2002. Algorithmics for hard problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics In deutscher Sprache. pages.

Etat : As New. Unread book in perfect condition.

Hardcover. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Etat : As New. Unread book in perfect condition.

PF. Etat : New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.