Contents Preface page xi 1 Background 1 1.1 Notion of Visibility 1 1.2 Polygon 2 1.3 Asymptotic Complexity 5 1.4 Triangulation 6 1.5 The Art Gallery Problem 8 1.6 Special Types of Visibility 11 2 Point Visibility 13 2.1 Problems and Results 13 2.2 C
这本书在国内已经绝版。目录如下 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
Input : argc, argv * * Output : int * * The usage of the clique program should * * be of the form: * * clique fileName numberOfPoints resolution xmin xmax ymin ymax tau * * * * Each parameter's meanning is : * * clique -- program's name * * string f
（为.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
