Overview

This book is an introduction to the methods of designing algorithms for hard computing tasks. This area has developed very dynamically in the last years and is one of the kernels of current research in algorithm and complexity theory. The book mainly concentrates on approximate, randomized and heuristic algorithms, and on the theoretical and experimental comparison of these approaches according to the requirements of the practice. There exist several monographs specializing in some of these methods, but no book systematically explains and compares all main possibilities of attacking hard computing problems. Since the topic is fundamental for the university study in computer science and essential for the transfer of formal methods to the practice, the aim of the book is to close this gap by providing at once a textbook for graduate students and a handbook for practitioners dealing with hard computing problems.

ISBN-13

9783540668602

ISBN-10

3540668608

Weight

1.92 Pounds

Dimensions

6.25 x 1.25 x 9.25 In

List Price

$44.95

Edition

1st Edition

Format

Hardcover

Pages

XI, 492 pages

Publisher

Springer

Published On

2001-06-15



View All Offers

Sort by:

Rows per page:

1–5 of 5

Condition
Seller
Seller Comments
Price
Used, Good
Seller details
HPB-Red
★★★★★

Dallas, TX, USA

Connecting readers with great books since 1972! Used textbooks may not include companion materials s...
$45.46

 Free delivery by: 31 Mar 2026

Used, Good
Seller details
HPB-Red
★★★★★

Dallas, TX, USA

Connecting readers with great books since 1972! Used textbooks may not include companion materials s...
$45.46

 Free delivery by: 31 Mar 2026

Used, Like New
Seller details
Rob the Book Man
★★★★★

Vancouver, WA, USA

Hardback in fine condition.
$65.13

 Free delivery by: 31 Mar 2026

Used, Good
Seller details
Bonita
★★★★☆

Santa Clarita, CA, USA

Access codes and supplements are not guaranteed with used items. May be an ex-library book.
$88.15

 Free delivery by: 31 Mar 2026


Bookstores.com relies on cookies to improve your experience.