|
|
|
|
| LEADER |
01441cam a22004577a 4500 |
| 001 |
BIBLO-39161 |
| 003 |
AR-BaUEN |
| 005 |
20240826193433.0 |
| 008 |
080411s2006 xxu||||f |||| 00| 0|eng|d |
| 040 |
|
|
|a AR-BaUEN
|b spa
|c AR-BaUEN
|
| 020 |
|
|
|a 9780321295354
|
| 044 |
|
|
|a xxu
|
| 080 |
|
|
|a 681.371
|
| 100 |
1 |
|
|a Kleinberg, Jon
|
| 245 |
1 |
0 |
|a Algorithm design
|
| 260 |
|
|
|a Boston, MA :
|b Pearson,
|c 2006
|
| 300 |
|
|
|a xxiii, 838 p.
|
| 505 |
0 |
0 |
|t About the Authors
|
| 505 |
0 |
0 |
|t Preface
|
| 505 |
0 |
0 |
|g 1
|t Introduction: Some Representative Problems
|
| 505 |
0 |
0 |
|g 2
|t Basics of Algorithm Analysis
|
| 505 |
0 |
0 |
|g 3
|t Graphs
|
| 505 |
0 |
0 |
|g 4
|t Greedy Algorithms
|
| 505 |
0 |
0 |
|g 5
|t Divide and Conquer
|
| 505 |
0 |
0 |
|g 6
|t Dynamic Programming
|
| 505 |
0 |
0 |
|g 7
|t Network Flow
|
| 505 |
0 |
0 |
|g 8
|t NP and Computational Intractability
|
| 505 |
0 |
0 |
|g 9
|t PSPACE: A Class of Problems beyond NP
|
| 505 |
0 |
0 |
|g 10
|t Extending the Limits of Tractability
|
| 505 |
0 |
0 |
|g 11
|t Approximation Algorithms
|
| 505 |
0 |
0 |
|g 12
|t Local Search
|
| 505 |
0 |
0 |
|g 13
|t Randomized Algorithms
|
| 505 |
0 |
0 |
|t Epilogue: Algorithms That Run Forever
|
| 505 |
0 |
0 |
|t References
|
| 505 |
0 |
0 |
|t Index
|
| 653 |
1 |
0 |
|a ALGORITMOS DE COMPUTADORA
|
| 653 |
1 |
0 |
|a ESTRUCTURAS DE DATOS
|
| 653 |
1 |
0 |
|a PROGRAMACION DINAMICA
|
| 700 |
1 |
|
|a Tardos, Eva
|
| 931 |
|
|
|a DC
|b ALGORITMO DE DATOS III
|
| 962 |
|
|
|a info:eu-repo/semantics/book
|a info:ar-repo/semantics/libro
|b info:eu-repo/semantics/publishedVersion
|