A guide to algorithm design : paradigms, methods, and complexity analysis
(eBook)
Author
Contributors
Published
Boca Raton : CRC Press, [2014].
Format
eBook
ISBN
1439898138, 9781439898130
Physical Desc
1 online resource : text file, PDF.
Status
Description
Loading Description...
Also in this Series
Checking series information...
More Details
Language
English
Notes
Bibliography
Includes bibliographical references and index.
Reviews from GoodReads
Loading GoodReads Reviews.
Citations
APA Citation, 7th Edition (style guide)
Benoit, A., Robert, Y., & Vivien, F. (2014). A guide to algorithm design: paradigms, methods, and complexity analysis . CRC Press.
Chicago / Turabian - Author Date Citation, 17th Edition (style guide)Benoit, Anne, Yves Robert and Frédéric, Vivien. 2014. A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis. CRC Press.
Chicago / Turabian - Humanities (Notes and Bibliography) Citation, 17th Edition (style guide)Benoit, Anne, Yves Robert and Frédéric, Vivien. A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis CRC Press, 2014.
MLA Citation, 9th Edition (style guide)Benoit, Anne,, Yves Robert, and Frédéric Vivien. A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis CRC Press, 2014.
Note! Citations contain only title, author, edition, publisher, and year published. Citations should be used as a guideline and should be double checked for accuracy. Citation formats are based on standards as of August 2021.
Staff View
Grouped Work ID
0531b862-9f5f-b14e-5ce2-6bcdca253511-eng
Grouping Information
| Grouped Work ID | 0531b862-9f5f-b14e-5ce2-6bcdca253511-eng |
|---|---|
| Full title | guide to algorithm design paradigms methods and complexity analysis |
| Author | benoit anne |
| Grouping Category | book |
| Last Update | 2024-09-06 16:31:08PM |
| Last Indexed | 2024-09-21 02:35:07AM |
Marc Record
| First Detected | Jul 29, 2024 04:02:34 PM |
|---|---|
| Last File Modification Time | Sep 06, 2024 04:37:15 PM |
MARC Record
| LEADER | 05438cam a2200625Mi 4500 | ||
|---|---|---|---|
| 001 | ocn958798506 | ||
| 003 | OCoLC | ||
| 005 | 20240830103855.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 160914s2014 flua ob 001 0 eng d | ||
| 010 | |a 2012278079 | ||
| 015 | |a GBB7C7359|2 bnb | ||
| 016 | 7 | |a 018428799|2 Uk | |
| 019 | |a 958506752|a 959147648|a 959881055|a 988029385|a 1066621400|a 1103264379|a 1153009490|a 1262674971 | ||
| 020 | |a 1439898138|q (electronic bk.) | ||
| 020 | |a 9781439898130|q (electronic bk.) | ||
| 020 | |z 1439825645 | ||
| 020 | |z 1439825653 | ||
| 020 | |z 1439898146 | ||
| 020 | |z 1466533870 | ||
| 020 | |z 9781439825648 | ||
| 020 | |z 9781439825655 | ||
| 020 | |z 9781439898147 | ||
| 020 | |z 9781466533875 | ||
| 035 | |a (OCoLC)958798506|z (OCoLC)958506752|z (OCoLC)959147648|z (OCoLC)959881055|z (OCoLC)988029385|z (OCoLC)1066621400|z (OCoLC)1103264379|z (OCoLC)1153009490|z (OCoLC)1262674971 | ||
| 037 | |a CL0500000862|b Safari Books Online | ||
| 040 | |a CRCPR|b eng|e rda|e pn|c CRCPR|d OCLCO|d OCLCF|d EBLCP|d OCLCQ|d UMI|d COO|d N$T|d YDX|d N$T|d CEF|d KSU|d OCLCQ|d NLE|d UKMGB|d WYU|d C6I|d UAB|d AU@|d VT2|d UKAHL|d OCLCQ|d OCLCA|d OCLCO|d OCL|d OCLCQ|d OCLCO|d OCLCL | ||
| 049 | |a FMGA | ||
| 050 | 4 | |a QA76.9.A43|b B46 2014 | |
| 066 | |c (S | ||
| 082 | 0 | 4 | |a 005.1|2 23 |
| 100 | 1 | |a Benoit, Anne,|e author. | |
| 245 | 1 | 2 | |a A guide to algorithm design :|b paradigms, methods, and complexity analysis /|c Anne Benoit, Yves Robert, and Frédérick Vivien. |
| 264 | 1 | |a Boca Raton :|b CRC Press,|c [2014] | |
| 264 | 4 | |c ©2014 | |
| 300 | |a 1 online resource :|b text file, PDF. | ||
| 336 | |a text|b txt|2 rdacontent | ||
| 337 | |a computer|b c|2 rdamedia | ||
| 338 | |a online resource|b cr|2 rdacarrier | ||
| 490 | 1 | |a Chapman & Hall/CRC Applied Algorithms and Data Structures series | |
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | |a 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 classes; NP-complete problems and reduction theory; Examples of NP-complete problems and reductions; Importance of problem definition; Strong NP-completeness; Why does it matter? Exercises on NP-Completeness; Easy reductions; About graph coloring; Scheduling problems; More involved reductions; 2-PARTITION is NP-complete Beyond NP-Completeness ; Approximation results; Polynomial problem instances; Linear programming; Randomized algorithms; Branch-and-bound and backtracking Exercises Going beyond NP-Completeness ; Approximation results; Dealing with NP-complete problems Reasoning on Problem Complexity ; Reasoning to Assess a Problem Complexity ; Basic | |
| 505 | 0 | |a 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 resources; Conclusion Replica Placement in Tree Networks ; Access policies; Complexity results; Variants of the replica placement problem; Conclusion Packet Routing ; MEDP: Maximum edge-disjoint paths; PRVP: Packet routing with variable-paths; Conclusion Matrix Product, or Tiling the Unit Square ; Problem motivation; NP-completeness; A guaranteed heuristic; Related problems Online Scheduling ; Flow time optimization; Competitive analysis; Makespan optimization; Conclusion Bibliography Index | |
| 650 | 0 | |a Computer algorithms.|0 http://id.loc.gov/authorities/subjects/sh91000149 | |
| 650 | 0 | |a Computational complexity.|0 http://id.loc.gov/authorities/subjects/sh85029473 | |
| 650 | 0 | |a Algorithms.|0 http://id.loc.gov/authorities/subjects/sh85003487 | |
| 700 | 1 | |a Robert, Yves,|d 1958 September 5-|e author.|0 http://id.loc.gov/authorities/names/n87872417 | |
| 700 | 1 | |a Vivien, Frédéric,|e author. | |
| 758 | |i has work:|a A guide to algorithm design (Text)|1 https://id.oclc.org/worldcat/entity/E39PCFQVg6BcVy4gCxd8vbDrMP|4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version:|z 9781439825648|z 1439825645 |
| 830 | 0 | |a Chapman & Hall/CRC applied algorithms and data structures series.|0 http://id.loc.gov/authorities/names/no2007106104 | |
| 856 | 4 | 0 | |u https://www.aclib.us/OReilly |
| 880 | 0 | |6 505-00/(S|a Polynomial-Time Algorithms: Exercises; Introduction to Complexity; On the complexity to compute xn ; Asymptotic notations: O, o, Θ, and Ω Divide-and-Conquer ; Strassen's algorithm; Master theorem; Solving recurrences Greedy Algorithms ; Motivating example: the sports hall; Designing greedy algorithms; Graph coloring; Theory of matroids Dynamic Programming ; The coin changing problem; The knapsack problem; Designing dynamic-programming algorithms Amortized Analysis ; Methods for amortized analysis Exercises, Solutions, | |
| 880 | |6 520-00/(S|a 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. | ||