Algorithm design /

Algorithm design /

Bibliografiska uppgifter
Huvudupphovsman:	Kleinberg, Jon
Övriga upphovsmän:	Tardos, Éva
Materialtyp:	Bok
Språk:	English
Publicerad:	Boston ; New Delhi : Pearson/Addison-Wesley, c2006.
Ämnen:	Computer algorithms. Data structures (Computer science)
Classic Catalogue:	View this record in Classic Catalogue

Innehållsförteckning:

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.