Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Paradigms for Fast Parallel Approximability
  • Cited by 6
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      March 2010
      July 1997
      ISBN:
      9780511666407
      9780521431705
      9780521117920
      DOI:
      https://doi.org/10.1017/CBO9780511666407
      Dimensions:
      (247 x 174 mm)
      Weight & Pages:
      0.465kg, 166 Pages
      Dimensions:
      (244 x 170 mm)
      Weight & Pages:
      0.28kg, 168 Pages
      • Subjects:
      Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Distributed, Networked and Mobile Computing, Programming Languages and Applied Logic
      Series:
      Cambridge International Series on Parallel Computation (8)
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Distributed, Networked and Mobile Computing, Programming Languages and Applied Logic
    Series:
    Cambridge International Series on Parallel Computation (8)
    Information

    Book description

    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.

    Reviews

    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 Source: CVu

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.