Algorithm design
Jon Kleinberg, Éva Tardos
- Boston Pearson/Addison-Wesley 2005
- xxiii, 838 páginas ilustraciones
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.