skip to content
A guide to algorithm design : paradigms, methods, and complexity analysis Preview this item
ClosePreview this item
Checking...

A guide to algorithm design : paradigms, methods, and complexity analysis

Author: Anne Benoit; Yves Robert; Frédéric Vivien
Publisher: Boca Raton, Fla. : CRC Press, 2012.
Series: Chapman & Hall/CRC applied algorithms and data structures series.
Edition/Format:   Print book : EnglishView all editions and formats
Rating:

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

Subjects
More like this

 

Find a copy in the library

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

Details

Document Type: Book
All Authors / Contributors: Anne Benoit; Yves Robert; Frédéric Vivien
ISBN: 9781439825648 1439825645
OCLC Number: 757931613
Description: xvii, 362 pages : illustrations ; 24 cm.
Contents: Polynomial-Time Algorithms: Exercises Introduction to Complexity On the complexity to compute xnAsymptotic notations: O, o, Î , and â ¦Divide-and-Conquer Strassen's algorithm Master theorem Solving recurrencesGreedy Algorithms Motivating example: the sports hall Designing greedy algorithms Graph coloringTheory of matroidsDynamic Programming The coin changing problem The knapsack problem Designing dynamic-programming algorithmsAmortized AnalysisMethods for amortized analysisExercises, Solutions, and Bibliographic Notes appear at the end of each chapter in this section.NP-Completeness and Beyond NP-Completeness A practical approach to complexity theory Problem classesNP-complete problems and reduction theory Examples of NP-complete problems and reductionsImportance of problem definition Strong NP-completeness Why does it matter?Exercises on NP-Completeness Easy reductionsAbout graph coloringScheduling problemsMore involved reductions2-PARTITION is NP-completeBeyond NP-Completeness Approximation resultsPolynomial problem instancesLinear programmingRandomized algorithms Branch-and-bound and backtrackingExercises Going beyond NP-Completeness Approximation resultsDealing with NP-complete problemsReasoning on Problem Complexity Reasoning to Assess a Problem Complexity Basic reasoning Set of problems with polynomial-time algorithms Set of NP-complete problems Chains-on-Chains Partitioning Optimal algorithms for homogeneous resources Variants of the problem Extension to a clique of heterogeneous resourcesConclusionReplica Placement in Tree Networks Access policies Complexity resultsVariants of the replica placement problem ConclusionPacket Routing MEDP: Maximum edge-disjoint pathsPRVP: Packet routing with variable-pathsConclusionMatrix Product, or Tiling the Unit Square Problem motivation NP-completeness A guaranteed heuristicRelated problemsOnline Scheduling Flow time optimization Competitive analysisMakespan optimizationConclusionBibliographyIndex
Series Title: Chapman & Hall/CRC applied algorithms and data structures series.
Responsibility: by Anne Benoit, Yves Robert and Frederick Raoul Vivien.

Reviews

Editorial reviews

Publisher Synopsis

"This well-written book takes a fresh look at a classical subject, with features that will please both instructors and students. The book provides an insightful introduction to algorithm design with Read more...

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

Tags

Be the first.

Similar Items

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/757931613> # A guide to algorithm design : paradigms, methods, and complexity analysis
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "757931613" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/flu> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/1029366955#Place/boca_raton_fla> ; # Boca Raton, Fla.
   schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
   schema:about <http://dewey.info/class/005.1/e23/> ;
   schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/100315344> ; # Yves Robert
   schema:contributor <http://viaf.org/viaf/57487557> ; # Frédéric Vivien
   schema:creator <http://viaf.org/viaf/305316303> ; # Anne Benoit
   schema:datePublished "2012" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/1029366955> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/1029366955#Series/chapman_&_hall_crc_applied_algorithms_and_data_structures_series> ; # Chapman & Hall/CRC applied algorithms and data structures series.
   schema:name "A guide to algorithm design : paradigms, methods, and complexity analysis"@en ;
   schema:productID "757931613" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/757931613#PublicationEvent/boca_raton_fla_crc_press_2012> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/1029366955#Agent/crc_press> ; # CRC Press
   schema:workExample <http://worldcat.org/isbn/9781439825648> ;
   umbel:isLike <http://bnb.data.bl.uk/id/resource/GBB1C1637> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/757931613> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/1029366955#Place/boca_raton_fla> # Boca Raton, Fla.
    a schema:Place ;
   schema:name "Boca Raton, Fla." ;
    .

<http://experiment.worldcat.org/entity/work/data/1029366955#Series/chapman_&_hall_crc_applied_algorithms_and_data_structures_series> # Chapman & Hall/CRC applied algorithms and data structures series.
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/757931613> ; # A guide to algorithm design : paradigms, methods, and complexity analysis
   schema:name "Chapman & Hall/CRC applied algorithms and data structures series." ;
   schema:name "Chapman & Hall/CRC applied algorithms and data structures series" ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
   schema:name "Computational complexity"@en ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
   schema:name "Computer algorithms"@en ;
    .

<http://viaf.org/viaf/100315344> # Yves Robert
    a schema:Person ;
   schema:birthDate "1938" ;
   schema:familyName "Robert" ;
   schema:givenName "Yves" ;
   schema:name "Yves Robert" ;
    .

<http://viaf.org/viaf/305316303> # Anne Benoit
    a schema:Person ;
   schema:familyName "Benoit" ;
   schema:givenName "Anne" ;
   schema:name "Anne Benoit" ;
    .

<http://viaf.org/viaf/57487557> # Frédéric Vivien
    a schema:Person ;
   schema:familyName "Vivien" ;
   schema:givenName "Frédéric" ;
   schema:name "Frédéric Vivien" ;
    .

<http://worldcat.org/isbn/9781439825648>
    a schema:ProductModel ;
   schema:isbn "1439825645" ;
   schema:isbn "9781439825648" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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