Skip to content
Register Sign in Wishlist

Paradigms for Fast Parallel Approximability

CAD$45.95 (C)

Part of Cambridge International Series on Parallel Computation

  • Date Published: July 2009
  • availability: Available
  • format: Paperback
  • isbn: 9780521117920

CAD$ 45.95 (C)

Add to cart Add to wishlist

Other available formats:
Hardback, eBook

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    • First book on subject
    • Can be used as advanced text or reference
    • Comprehensive and thorough
    Read more

    Reviews & endorsements

    "This monograph reads as smoothly as a single-author work. It can serve as an excellent reference for those interested in algorithmic and computational complexity results in parallel approximability. It can also serve as an excellent introduction to the field for theoretical researchers." Computing Reviews

    "This is an excellent monograph that surveys one of the key parts of recent algorithm and complexity theory. This book really corresponds to its title Paradigms of fast parallel approximability. Because of this it is much more than a survey on the recent development in this area. I strongly recommend it as a valuable source for graduate courses in the subject also." Juraj Hromkovi^Dvc, Mathematical Reviews

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: July 2009
    • format: Paperback
    • isbn: 9780521117920
    • length: 168 pages
    • dimensions: 244 x 170 x 9 mm
    • weight: 0.28kg
    • contains: 32 b/w illus.
    • availability: Available
  • Table of Contents

    1. Introduction
    2. Basic concepts
    3. Extremal graph properties
    4. Rounding, interval partitioning and separation
    5. Primal-dual method
    6. Graph decomposition
    7. Further parallel approximations
    8. Non-approximability
    9. Syntactical defined phrases
    Appendix: Definition of problems

  • Authors

    Josep Díaz, Universitat Politècnica de Catalunya, Barcelona

    Maria Serna, Universitat Politècnica de Catalunya, Barcelona

    Paul Spirakis, University of Patras, Greece

    Jacobo Torán, Universität Ulm, Germany

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.