skip to content
Paradigms for fast parallel approximability Preview this item
ClosePreview this item
Checking...

Paradigms for fast parallel approximability

Author: J Díaz
Publisher: Cambridge ; New York : Cambridge University Press, 1997.
Series: Cambridge international series on parallel computation, 8.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Summary:
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,  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Additional Physical Format: Print version:
Paradigms for fast parallel approximability.
Cambridge ; New York : Cambridge University Press, 1997
(DLC) 96051778
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: J Díaz
ISBN: 9780511666407 0511666403
OCLC Number: 726828076
Description: 1 online resource (viii, 158 pages) : illustrations.
Contents: Basic concepts --
Extremal graph properties --
Rounding, interval partitioning and separation --
Primal-dual method --
Graph decomposition --
Further parallel approximations --
Non-approximability --
Syntactically defined classes.
Series Title: Cambridge international series on parallel computation, 8.
Responsibility: Josep Díaz [and others].

Abstract:

A survey of the basic techniques for approximating combinatorial problems using parallel algorithms.  Read more...

Reviews

Editorial reviews

Publisher Synopsis

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

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/726828076> # Paradigms for fast parallel approximability
    a schema:MediaObject, schema:Book, schema:CreativeWork ;
    library:oclcnum "726828076" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/enk> ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/917503937#Place/cambridge> ; # Cambridge
    schema:about <http://experiment.worldcat.org/entity/work/data/917503937#Topic/parallelverarbeitung> ; # Parallelverarbeitung
    schema:about <http://experiment.worldcat.org/entity/work/data/917503937#Topic/pram> ; # PRAM
    schema:about <http://experiment.worldcat.org/entity/work/data/917503937#Topic/graphentheorie> ; # Graphentheorie
    schema:about <http://dewey.info/class/511.60285435/e21/> ;
    schema:about <http://id.worldcat.org/fast/1052928> ; # Parallel processing (Electronic computers)
    schema:bookFormat schema:EBook ;
    schema:contributor <http://viaf.org/viaf/32071049> ; # Josep Díaz
    schema:datePublished "1997" ;
    schema: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."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/917503937> ;
    schema:genre "Electronic books"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/917503937#Series/cambridge_international_series_on_parallel_computation> ; # Cambridge international series on parallel computation ;
    schema:isSimilarTo <http://worldcat.org/entity/work/data/917503937#CreativeWork/paradigms_for_fast_parallel_approximability> ;
    schema:name "Paradigms for fast parallel approximability"@en ;
    schema:productID "726828076" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/726828076#PublicationEvent/cambridge_new_york_cambridge_university_press_1997> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/917503937#Agent/cambridge_university_press> ; # Cambridge University Press
    schema:url <http://dx.doi.org/10.1017/CBO9780511666407> ;
    schema:url <http://www.survey.bris.ac.uk/standrews/cambridgebooksonlinetrial> ;
    schema:url <http://site.ebrary.com/id/10461899> ;
    schema:workExample <http://worldcat.org/isbn/9780511666407> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/726828076> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

<http://dx.doi.org/10.1017/CBO9780511666407>
    rdfs:comment "Connect to e-book" ;
    .

<http://experiment.worldcat.org/entity/work/data/917503937#Agent/cambridge_university_press> # Cambridge University Press
    a bgn:Agent ;
    schema:name "Cambridge University Press" ;
    .

<http://experiment.worldcat.org/entity/work/data/917503937#Series/cambridge_international_series_on_parallel_computation> # Cambridge international series on parallel computation ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/726828076> ; # Paradigms for fast parallel approximability
    schema:name "Cambridge international series on parallel computation ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/917503937#Topic/parallelverarbeitung> # Parallelverarbeitung
    a schema:Intangible ;
    schema:name "Parallelverarbeitung"@en ;
    .

<http://id.worldcat.org/fast/1052928> # Parallel processing (Electronic computers)
    a schema:Intangible ;
    schema:name "Parallel processing (Electronic computers)"@en ;
    .

<http://viaf.org/viaf/32071049> # Josep Díaz
    a schema:Person ;
    schema:birthDate "1950" ;
    schema:familyName "Díaz" ;
    schema:givenName "Josep" ;
    schema:givenName "J." ;
    schema:name "Josep Díaz" ;
    .

<http://worldcat.org/entity/work/data/917503937#CreativeWork/paradigms_for_fast_parallel_approximability>
    a schema:CreativeWork ;
    rdfs:label "Paradigms for fast parallel approximability." ;
    schema:description "Print version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/726828076> ; # Paradigms for fast parallel approximability
    .

<http://worldcat.org/isbn/9780511666407>
    a schema:ProductModel ;
    schema:isbn "0511666403" ;
    schema:isbn "9780511666407" ;
    .

<http://www.survey.bris.ac.uk/standrews/cambridgebooksonlinetrial>
    rdfs:comment "We have trial access to this e-book until 31/7/2012 through our Cambridge Books Online trial of over 12,000 titles. Please tell us if you would like to recommend continued access to it" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.