|
|
|
|
| LEADER |
00000cam a2200000Mi 4500 |
| 001 |
in00006071077 |
| 006 |
m o d |
| 007 |
cr cn||||||||| |
| 008 |
160914s2014 flua ob 001 0 eng d |
| 005 |
20220713132955.7 |
| 010 |
|
|
|a 2012278079
|
| 035 |
|
|
|a 1WRLDSHRocn958798506
|
| 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
|
| 066 |
|
|
|c (S
|
| 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 9781439898130
|q (electronic bk.)
|
| 020 |
|
|
|a 1439898138
|q (electronic bk.)
|
| 020 |
|
|
|z 9781439825648
|
| 020 |
|
|
|z 1439825645
|
| 020 |
|
|
|z 9781439898147
|
| 020 |
|
|
|z 1439898146
|
| 020 |
|
|
|z 9781466533875
|
| 020 |
|
|
|z 1466533870
|
| 020 |
|
|
|z 9781439825655
|
| 020 |
|
|
|z 1439825653
|
| 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
|
| 050 |
|
4 |
|a QA76.9.A43
|b B46 2014
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 049 |
|
|
|a TXMM
|
| 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
|
| 590 |
|
|
|a O'Reilly Online Learning Platform: Academic Edition (SAML SSO Access)
|
| 650 |
|
0 |
|a Computer algorithms.
|
| 650 |
|
0 |
|a Computational complexity.
|
| 650 |
|
0 |
|a Algorithms.
|
| 700 |
1 |
|
|a Robert, Yves,
|d 1958 September 5-
|e author.
|
| 700 |
1 |
|
|a Vivien, Frédéric,
|e author.
|
| 730 |
0 |
|
|a WORLDSHARE SUB RECORDS
|
| 776 |
0 |
8 |
|i Print version:
|z 9781439825648
|z 1439825645
|
| 830 |
|
0 |
|a Chapman & Hall/CRC applied algorithms and data structures series.
|
| 856 |
4 |
0 |
|u https://go.oreilly.com/middle-tennessee-state-university/library/view/-/9781439898130/?ar
|z CONNECT
|3 O'Reilly
|t 0
|
| 880 |
0 |
|
|6 505-00
|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.
|
| 949 |
|
|
|a ho0
|
| 994 |
|
|
|a 92
|b TXM
|
| 998 |
|
|
|a wi
|d z
|
| 999 |
f |
f |
|s 7c5088b0-7b95-42cf-9043-a230f55065fe
|i 9f2f8c21-1779-462d-86cf-988aa92817ba
|t 0
|
| 952 |
f |
f |
|a Middle Tennessee State University
|b Main
|c James E. Walker Library
|d Electronic Resources
|t 0
|e QA76.9.A43 B46 2014
|h Library of Congress classification
|
| 856 |
4 |
0 |
|3 O'Reilly
|t 0
|u https://go.oreilly.com/middle-tennessee-state-university/library/view/-/9781439898130/?ar
|z CONNECT
|
