Skip to content
Register Sign in Wishlist

Paradigms for Fast Parallel Approximability

$32.00 USD

Part of Cambridge International Series on Parallel Computation

  • Date Published: April 2011
  • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • format: Adobe eBook Reader
  • isbn: 9780511881886

$ 32.00 USD
Adobe eBook Reader

You will be taken to ebooks.com for this purchase
Buy eBook Add to wishlist

Other available formats:
Paperback, Hardback


Looking for an inspection copy?

This title is not currently available on inspection

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

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

    Reviews & endorsements

    Review of the hardback: 'Required reading for researchers working on parallel algorithms and of interest to anyone working in the area of parallel computing in general.' Brian Bramer, CVu

    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: April 2011
    • format: Adobe eBook Reader
    • isbn: 9780511881886
    • contains: 32 b/w illus.
    • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • 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
    Bibliography
    Index.

  • 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

Cancel

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 lecturers@cambridge.org

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 www.ebooks.com. Please see the permission section of the www.ebooks.com 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.

Cancel

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.
×