Contact
How to shop
Delivery
Shopping guide
Paradigms for Fast Parallel Approximability
English
131 b
30-day return policy
Customers also purchased
/
Paperback
32.06
€
/
Paperback
39.25
€
/
Paperback
95.50
€
/
Paperback
39.04
€
/
Paperback
21.24
€
/
Paperback
14.56
€
Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
15.57
€
/
Paperback
11.73
€
/
Paperback
10.31
€
/
Paperback
13.95
€
