This book describes data structures, methods of organizing large amounts of data, and algorithm analysis, the estimation of the running time of algorithms. As computers become faster and faster, the need for programs that can handle large amounts of
Organisation pratique du cours : R´ef´erences • Introduction `a la calculabilit´e, Pierre Wolper, InterEditions, 1991. • Computational Complexity, Christos H. Papadimitriou, Addison Wesley, 1994. • Computers and Intractability - A Guide to the Theor
这本书在国内已经绝版。目录如下 Introduction Dorit S. Hochbaum 0.1 What can approximation algorithms do for you: an illustrative example 0.2 Fundamentals and concepts 0.3 Objectives and organization of this book 0.4 Acknowledgments I Approximation Algorithms for Sc
Aho Garey Ullman The transitive reduction of a directed graphAho Garey Ullman The transitive reduction of a directed graphAho Garey Ullman The transitive reduction of a directed graphAho Garey Ullman The transitive reduction of a directed graphAho G
（为.djvu文件，可用WinDjView 打开） COMPUTERS AND INTRACTABILITY： A Guide to the Theory of NP-Completeness by Michael R. Garey & David S. Johnson Content 1 Computers, Complexity, and Intractability 1 1.1 Introduction 1 1.2 Problems, Algorithms, and Complexity
PREFACE Purpose/Goals This book describes data structures, methods of organizing large amounts of data, and algorithm analysis, the estimation of the running time of algorithms. As computers become faster and faster, the need for programs that can h
