Algorithm design /

Détails bibliographiques
Auteur principal: Kleinberg, Jon
Autres auteurs: Tardos, Éva
Format: Livre
Langue:English
Publié: Boston ; New Delhi : Pearson/Addison-Wesley, c2006.
Sujets:
Classic Catalogue: View this record in Classic Catalogue
Table des matières:
  • 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.