part Part I: Basic Methodologies -- chapter 1 Introduction, Overview, and Notation -- chapter 2 Basic Methodologies and Applications -- chapter 3 Restriction Methods -- chapter 4 Greedy Methods -- chapter 5 Recursive Greedy Methods -- chapter 6 Linear Programming -- chapter 7 LP Rounding and Extensions -- chapter 8 On Analyzing Semidefinite Programmng Relaxations of Complex Quadratic Optimization Problems -- chapter 9 Polynomial-Time Approximation Schemes -- chapter 10 Rounding, Interval Partitioning, and Separation -- chapter 11 Asymptotic Polynomial-Time Approximation Schemes -- chapter 12 Randomized Approximation Techniques -- chapter 13 Distributed Apporximation Algorithms via LP-Duality and Randomization -- chapter 14 Empirical Analysis of Randomized Algorithms -- chapter 15 Reductions That Preserve Approximability -- chapter 16 Differential Ratio Approximation -- chapter 17 Hardness of Approximation -- part Part II: Local Search, Neural Networks, and Metaheuristics -- chapter 18 Local Search -- chapter 19 Stochastic Local Search -- chapter 20 Very Large-Scale Neighborhood Search: Theory, Algorithms, and Applications -- chapter 21 Reactive Search: Machine Learning for Memory-Based Heuristics -- chapter 22 Neural Networks -- chapter 23 Principles of Tabu Search -- chapter 24 Evolutionary Computation -- chapter 25 Simulated Annealing -- chapter 26 Ant Colony Optimization -- chapter 27 Memetic Algorithms -- part Part III: Multiobjective Optimization, Sensitivity Analysis, and Stability -- chapter 28 Approximation in Multiobjective Problems -- chapter 29 Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A Review -- chapter 30 Sensitivity Analysis in Combinatorial Optimization -- chapter 31 Stability of Approximation -- part Part IV: Traditional Applications -- chapter 32 Performance Guarantees for One-Dimensional Bin Packing -- chapter 33 Variants of Classical One-Dimensional Bin Packing -- chapter 34 Variable-Sized Bin Packing and Bin Covering -- chapter 35 Multidimensional Packing Problems -- chapter 36 Practical Algorithms for Two-Dimensional Packing -- chapter 37 A Generic Primal-Dual Approximation Algorithm for an Interval Packing and Sstabbing Problem -- chapter 38 Approximation Algorithms for Facility Dispersion -- chapter 39 Greedy Algorithms for Metric Facility Location Problems -- chapter 40 Prize-Collecting Traveling Salesman and Related Problems -- chapter 41 A Development and Deployment Framework for Distributed Branch and Bound -- chapter 42 Approximations for Steiner Minimum Trees -- chapter 43 Practical Approximations of Steiner Trees in Uniform Orientation Metrics -- chapter 44 Approximation Algorithms for Imprecise Computation Task with 0/1 Constraint -- chapter 45 Scheduling Malleable Tasks -- chapter 46 Vehicle Scheduling Problems in Graphs -- chapter 47 Approximation Algorithms and Heuristics for Classical Planning -- chapter 48 Generalized Assignment Problem -- chapter 49 Probabilistic Greedy Heuristics for Satisfiability Problems -- part Part V: Computational Geometry and Graph Applications -- chapter 50 Approximation Algorithms for Some Optimal 2D and 3D Triangulations -- chapter 51 Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs -- chapter 52 Dilation and Detours in Geometric Networks -- chapter 53 The Well-Separated Pair Decomposition and Its Applications -- chapter 54 Minimum-Edge Length Rectangular Partitions -- chapter 55 Partitioning Finite d-Dimensional Integer Grids with Applications -- chapter 56 Maximum Planar Subgraph -- chapter 57 Edge-Disjoint Paths and Unsplittable Flow -- chapter 58 Approximating Minimum-Cost Connectivity Problems -- chapter 59 Optimum Communication Spanning Trees -- chapter 60 Approximation Algorithms for Multilevel Graph Partitioning -- chapter 61 Hypergraph Partitioning and Clustering -- chapter 62 Finding Most Vital Edges in a Graph -- chapter 63 Stochastic Local Search Algorithms for the Graph Coloring Problem -- chapter 64 On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization -- part Part VI: Large-Scale and Emerging Applications -- chapter 65 Cost-Efficient Multicast Routing in Ad Hoc and Sensor Networks -- chapter 66 Approximation Algorithm for Clustering in Ad Hoc Networks -- chapter 67 Topology Control Problems for Wireless Ad Hoc Networks -- chapter 68 Geometrical Spanner for Wireless Ad Hoc Networks -- chapter 69 Multicast Topology Inference and Its Applications -- chapter 70 Multicast Congestion in Ring Networks -- chapter 71 QoS Multimedia Multicast Routing -- chapter 72 Overlay Networks for Peer-to-Peer Networks -- chapter 73 Scheduling Data Broadcasts on Wireless Channels: Exact Solutions and Heuristics* -- chapter 74 Combinatorial and Algorithmic Issues for Microarray Analysis -- chapter 75 Approximation Algorithms for the Primer Selection, Planted Motif Search, and Related Problems -- chapter 76 Dynamic and Fractional Programming-Based Approximation Algorithms for Sequence Alignment with Constraints -- chapter 77 Approximation Algorithms for the Selection of Robust Tag SNPs -- chapter 78 Sphere Packing and Medical Applications -- chapter 79 Large-Scale Global Placement -- chapter 80 Multicommodity Flow Algorithms for Buffered Global Routing / chapter 81 Algorithmic Game Theory and Scheduling -- chapter 82 Approximate Economic Equilibrium Algorithms -- chapter 83 Approximation Algorithms and Algorithm Mechanism Design -- chapter 84 Histograms, Wavelets, Streams, and Approximation -- chapter 85 Digital Reputation for Virtual Communities -- chapter 86 Color Quantization.