Algorithm design /
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | كتاب |
| اللغة: | English |
| منشور في: |
Boston ; New Delhi :
Pearson/Addison-Wesley,
c2006.
|
| الموضوعات: | |
| Classic Catalogue: | View this record in Classic Catalogue |
جدول المحتويات:
- Introduction: Some representative problems
- Basics of algorithms analysis
- Graphs
- Greedy algorithms
- Divide and conquer
- Dynamic programming
- Network flow
- NP and computational intractability
- PSPACE: A class of problems beyond NP
- Extending the limits of tractability
- Approximation algorithms
- Local search
- Randomized algorithms
- Epilogue: algorithms that run forever.