# Handbook of Approximation Algorithms and Metaheuristics

DOI link for Handbook of Approximation Algorithms and Metaheuristics

Handbook of Approximation Algorithms and Metaheuristics book

# Handbook of Approximation Algorithms and Metaheuristics

DOI link for Handbook of Approximation Algorithms and Metaheuristics

Handbook of Approximation Algorithms and Metaheuristics book

#### Get Citation

** Handbook of Approximation Algorithms and Metaheuristics, Second Edition** reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics.

Volume 1 of this two-volume set deals primarily with methodologies and traditional applications. It includes restriction, relaxation, local ratio, approximation schemes, randomization, tabu search, evolutionary computation, local search, neural networks, and other metaheuristics. It also explores multi-objective optimization, reoptimization, sensitivity analysis, and stability. Traditional applications covered include: bin packing, multi-dimensional packing, Steiner trees, traveling salesperson, scheduling, and related problems.

Volume 2 focuses on the contemporary and emerging applications of methodologies to problems in combinatorial optimization, computational geometry and graphs problems, as well as in large-scale and emerging application areas. It includes approximation algorithms and heuristics for clustering, networks (sensor and wireless), communication, bioinformatics search, streams, virtual communities, and more.

About the Editor

**Teofilo F. Gonzalez **is a professor emeritus of computer science at the University of California, Santa Barbara. He completed his Ph.D. in 1975 from the University of Minnesota. He taught at the University of Oklahoma, the Pennsylvania State University, and the University of Texas at Dallas, before joining the UCSB computer science faculty in 1984. He spent sabbatical leaves at the Monterrey Institute of Technology and Higher Education and Utrecht University. He is known for his highly cited pioneering research in the hardness of approximation; for his sublinear and best possible approximation algorithm for k-tMM clustering; for introducing the open-shop scheduling problem as well as algorithms for its solution that have found applications in numerous research areas; as well as for his research on problems in the areas of job scheduling, graph algorithms, computational geometry, message communication, wire routing, etc.

## TABLE OF CONTENTS

part I|340 pages

Computational Geometry and Graph Applications

chapter 2|24 pages

#### Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs *

chapter 3|17 pages

#### Dilation and Detours in Geometric Networks

chapter 7|28 pages

#### Automatic Placement of Labels in Maps and Drawings

chapter 8|14 pages

#### Complexity, Approximation Algorithms, and Heuristics for the Corridor Problems

chapter 16|18 pages

#### Stochastic Local Search Algorithms for the Graph Coloring Problem

chapter 17|16 pages

#### On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization

chapter 18|13 pages

#### Efficient Approximation Algorithms in Random Intersection Graphs

chapter 19|18 pages

#### Approximation Algorithms for Facility Dispersion

part II|405 pages

Large-Scale and Emerging Applications