Gonzalez Handbook of Approximation Algorithms and Metaheuristics, Second Edition

Contemporary and Emerging Applications, Volume 2
2. Auflage 2018
ISBN: 978-1-351-23541-9
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)

E-Book, Englisch, 796 Seiten

Reihe: Chapman & Hall/CRC Computer and Information Science Series

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 scheduling, graph, computational geometry, communication, routing, etc.

Autoren/Hrsg.

Gonzalez, Teofilo F.

Fachgebiete

• Mathematik | Informatik EDV | Informatik Technische Informatik
• Mathematik | Informatik Mathematik Algebra Zahlentheorie

Inhaltsverzeichnis

1 Introduction, Overview and Definitions
Teofilo F. Gonzalez

Part I: Computational Geometry and Graph Applications

2 Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs
Artur Czumaj and Andrzej Lingas

3 Dilation and Detours in Geometric Networks
Joachim Gudmundsson and Christian Knauer

4 TheWell-Separated Pair Decomposition and Its Applications
Michiel Smid

5 Covering with Unit Balls
Hossein Ghasemalizadeh and Mohammadreza Razzazi

6 Minimum Edge Length Rectangular Partitions
Teofilo F. Gonzalez and Si Qing Zheng

7 Automatic Placement of Labels in Maps and Drawings
Konstantinos G. Kakoulis and Ioannis G. Tollis

8 Complexity, Approximation Algorithms, and Heuristics for the Corridor Problems
Teofilo F. Gonzalez and Arturo Gonzalez-Gutierrez

9 Approximate Clustering
Ragesh Jaiswal and Sandeep Sen

10 Maximum Planar Subgraph
Gruia Calinescu and Cristina G. Fernandes

11 Disjoint Paths and Unsplittable Flow
Stavros G. Kolliopoulos

12 The k-Connected subgraph Problem
Zeev Nutov

13 Node-Connectivity Survivable Network Problems
Zeev Nutov

14 Optimum Communication Spanning Trees
Bang Ye Wu, Chuan Yi Tang, and Kun-Mao Chao

15 Activation Network Design Problems
Zeev Nutov

16 Stochastic Local Search Algorithms for the Graph Colouring Problem
Marco Chiarandini, Irina Dumitrescu, and Thomas St¨utzle

17 On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization
Maria J. Blesa and Christian Blum

18 Efficient Approximation Algorithms in Random Intersection Graphs
Sotiris Nikoletseas, Christoforos L. Raptopoulos, and Paul Spirakis

19 Approximation Algorithms for Facility Dispersion
S.S. Ravi, Daniel J. Rosenkrantz, and Giri K. Tayi

Part II: Large-Scale and Emerging Applications

20 Cost-Efficient Multicast Routing in Ad Hoc and Sensor Networks
Pedro M. Ruiz and Ivan Stojmenovic

21 Approximation Algorithm for Clustering in Ad-hoc Networks
Lan Wang, Xianping Wang, and Stephan Olariu

22 Topology Control Problems for Wireless Ad hoc Networks
Gruia Calinescu, Errol L. Lloyd, and S. S. Ravi

23 QoS Multimedia Multicast Routing
Ion Mandoiu, Alex Olshevsky, and Alexander Zelikovsky

24 Overlay Networks for Peer-to-Peer Networks
Andr´ea W. Richa and Christian Scheideler

25 Scheduling Data Broadcasts on Wireless Channels: Exact Solutions and Time-Optimal Solutions for Uniform Data and Heuristics for Non-Uniform Data
Alan A. Bertossi, M. Cristina Pinotti, and Romeo Rizzi

26 Strategies for Aggregating Time-discounted Information in Sensor Networks
Xianping Wang and Stephan Olariu

27 Approximation and exact algorithms for optimally placing a limited number of storage nodes in a wireless sensor network
Gianlorenzo D’Angelo, Alfredo Navarra, and M. Cristina Pinotti

28 Approximation Algorithms for the Primer Selection, PlantedMotif Search, and Related Problems
Sudha Balla, Jaime Davila, Marius Nicolae, and Sanguthevar Rajasekaran

29 Dynamic and Fractional Programming based Approximation Algorithms for Sequence Alignment with Constraints
Abdullah N. Arslan and ¨Omer Egecioglu

30 Approximation Algorithms for the Selection of Robust Tag SNPs
Yao-Ting Huang, Kui Zhang, Ting Chen, and Kun-Mao Chao

31 Large-Scale Global Placement
Jason Cong and Joseph R. Shinnerl

32 Histograms,Wavelets, Streams and Approximation
Sudipto Guha

33 A GSO based Swarm Algorithm for Odor Source Localization in Turbulent Environments
Joseph Thomas and Debasish Ghose

34 Color Quantization
Zhigang Xiang

35 Digital Reputation for Virtual Communities
Roberto Battiti and Anurag Garg

36 Approximation for Influence Maximization
Jing Yuan, Weili Wu, and Wen Xu

37 Approximation and Heuristics for Community Detection
Jing Yuan, Weili Wu, and Sarat Chandra Varanasi

Über Autor(innen)

Teofilo Gonzalez is a professor of computer science at the University of California, Santa Barbara.