Algorithm design /

Dades bibliogràfiques
Autor principal: Kleinberg, Jon
Altres autors: Tardos, Éva
Format: Llibre
Idioma:English
Publicat: Boston ; New Delhi : Pearson/Addison-Wesley, c2006.
Matèries:
Classic Catalogue: View this record in Classic Catalogue
Taula de continguts:
  • 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.