http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
0. Prologue -- 1. Algorithms with numbers -- 2. Divide-and conquer algorithms -- 3. Decompositions of graphs -- 4. Paths in graphs -- 5. Greedy algorithms -- 6. Dynamic programming -- 7. Linear programming and reductions -- 8. NP-complete problems -- 9. Coping with NP-completeness -- 10. Quantum algorithms -- Historical notes and futher reading -- index.
Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani.