Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Paradigms for Fast Parallel Approximability

Paradigms for Fast Parallel Approximability

Serna, Maria
Spirakis, Paul
Diaz, Josep

Paperback

Series: Cambridge International Parallel Computation, Book 8

General MathematicsNetworking

ISBN10: 0521117925
ISBN13: 9780521117920
Publisher: Cambridge University Press
Published: Jul 30 2009
Pages: 168
Weight: 0.61
Height: 0.36 Width: 6.69 Depth: 9.61
Language: English
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, such as flows, coverings, matchings, traveling salesman problems, and graphs. For added clarity, 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 rounded off by an appendix that gives a convenient summary of the problems described in the book. This book is an up-to-date reference for research workers in the area of algorithms and for graduate courses in the subject.

Also in

Networking

View All