|
|
|
|
| LEADER |
01423cam a22004457a 4500 |
| 001 |
BIBLO-21695 |
| 003 |
AR-BaUEN |
| 005 |
20240819193205.0 |
| 008 |
930604s1984 xxu||||f |||| 00| 0|eng|d |
| 040 |
|
|
|a AR-BaUEN
|b spa
|c AR-BaUEN
|
| 020 |
|
|
|a 0914894226
|
| 044 |
|
|
|a xxu
|
| 080 |
|
|
|a 681.
|
| 100 |
1 |
|
|a Horowitz, Ellis
|
| 245 |
1 |
0 |
|a Fundamentals of computer algorithms
|
| 250 |
|
|
|a 1st. ed.
|
| 260 |
|
|
|a Rockville :
|b Computer Science Press,
|c c1984
|
| 300 |
|
|
|a 626 p.
|
| 490 |
0 |
|
|a Computer software engineering series
|
| 505 |
0 |
0 |
|t PREFACE
|
| 505 |
0 |
0 |
|g 1.
|t INTRODUCTION
|
| 505 |
0 |
0 |
|g 2.
|t ELEMENTARY DATA STRUCTURES
|
| 505 |
0 |
0 |
|g 3.
|t DIVIDE-AND-CONQUER
|
| 505 |
0 |
0 |
|g 4.
|t THE GREEDY METHOD
|
| 505 |
0 |
0 |
|g 5.
|t DYNAMIC PROGRAMMING
|
| 505 |
0 |
0 |
|g 6.
|t BASIC SEARCH AND TRAVERSAL TECHNIQUES
|
| 505 |
0 |
0 |
|g 7.
|t BACKTRACKING
|
| 505 |
0 |
0 |
|g 8.
|t BRANCH-AND-BOUND
|
| 505 |
0 |
0 |
|g 9.
|t ALGEBRAIC SIMPLIFICATION AND TRANSFORMATIONS
|
| 505 |
0 |
0 |
|g 10.
|t LOWER BOUND THEORY
|
| 505 |
0 |
0 |
|g 11.
|t NP-HARD AND NP-COMPLETE PROBLEMS
|
| 505 |
0 |
0 |
|g 12.
|t APPROXIMATION ALGORITHMS FOR NP-HARD PROBLEMS
|
| 505 |
0 |
0 |
|g APPENDIX A.
|t SPARKS
|
| 505 |
0 |
0 |
|t INDEX
|
| 653 |
1 |
0 |
|a PROGRAMACION DE COMPUTADORES
|
| 653 |
1 |
0 |
|a SOFTWARE
|
| 653 |
1 |
0 |
|a PROGRAMAS DE COMPUTADORAS
|
| 653 |
1 |
0 |
|a ALGORITMOS
|
| 700 |
1 |
|
|a Sahni, Sartaj
|
| 962 |
|
|
|a info:eu-repo/semantics/book
|a info:ar-repo/semantics/libro
|b info:eu-repo/semantics/publishedVersion
|