Isbn: 9783540441342 - algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics (17 risultati)

Condizione: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Hardcover. Condizione: 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.

Condizione: New.

Condizione: New.

hardcover. Condizione: New. In shrink wrap. Looks like an interesting title.

hardcover. Condizione: New. In shrink wrap. Looks like an interesting title.

Condizione: New. In English.

Condizione: New.

Condizione: New. pp. 556 2nd Corrected Printing.

Condizione: New. 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.

Condizione: As New. Unread book in perfect condition.

Buch. Condizione: 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. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: As New. Unread book in perfect condition.

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

Condizione: New. Print on Demand pp. 556 Illus.

Condizione: New. PRINT ON DEMAND pp. 556.