- By Language
- By Problem
- 1.1 Data Structures
- 1.2 Numerical Problems
- 1.3 Combinatorial Problems
- 1.4 Graph Problems -- polynomial-time problems
- 1.5 Graph Problems -- hard problems
- 1.6 Computational Geometry
- Robust Geometric Primitives
- Convex Hull
- Triangulation
- Voronoi Diagrams
- Nearest Neighbor Search
- Range Search
- Point Location
- Intersection Detection
- Bin Packing
- Medial-Axis Transformation
- Polygon Partitioning
- Simplifying Polygons
- Shape Similarity
- Motion Planning
- Maintaining Line Arrangements
- Minkowski Sum
- 1.7 Set and String Problems
- Algorithm Links
Approximation Algorithms for NP-hard Problems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Handbook of Approximation Algorithms and Metaheuristics
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Approximation Algorithms