Handbook of Approximation Algorithms and Metaheuristics, Second Edition: Contemporary and Emerging Applications, Volume 2

Content: Cover
 Half Title
 Title Page
 Copyright Page
 Dedication
 Table of Contents
 Preface
 Contributors
 1: Introduction, Overview, and Notation
 SECTION I: Computational Geometry and Graph Applications
 2: Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs
 3: Dilation and Detours in Geometric Networks
 4: The Well-Separated Pair Decomposition and Its Applications
 5: Covering with Unit Balls
 6: Minimum Edge-Length Rectangular Partitions
 7: Automatic Placement of Labels in Maps and Drawings 8: Complexity, Approximation Algorithms, and Heuristics for the Corridor Problems9: Approximate Clustering
 10: Maximum Planar Subgraph
 11: Disjoint Paths and Unsplittable Flow
 12: The k-Connected Subgraph Problem
 13: Node-Connectivity Survivable Network Problems
 14: Optimum Communication Spanning Trees
 15: Activation Network Design Problems
 16: Stochastic Local Search Algorithms for theGraph Coloring Problem
 17: On Solving the Maximum Disjoint Paths Problem with Ant Colony Optimization
 18: Efficient Approximation Algorithms in Random Intersection Graphs 19: Approximation Algorithms for Facility DispersionSECTION II: Large-Scale and Emerging Applications
 20: Cost-Efficient Multicast Routing in Ad Hoc and Sensor Networks
 21: Approximation Algorithm for Clustering in Mobile Ad-Hoc Networks
 22: Topology Control Problems for Wireless Ad Hoc Networks
 23: QoS Multimedia Multicast Routing
 24: Overlay Networks for Peer-to-Peer Networks
 25: Data Broadcasts on Multiple Wireless Channels: Exact and Time-Optimal Solutions for Uniform Data and Heuristics for Nonuniform Data 26: Strategies for Aggregating Time-Discounted Information in Sensor Networks27: Approximation and Exact Algorithms for Optimally Placing a Limited Number of Storage Nodes in a Wireless Sensor Network
 28: Approximation Algorithms for the Primer Selection, Planted Motif Search, and Related Problems
 29: Dynamic and Fractional Programming-Based Approximation Algorithms for Sequence Alignment with Constraints
 30: Approximation Algorithms for the Selection of Robust Tag SNPs
 31: Large-Scale Global Placement
 32: Histograms,Wavelets, Streams, and Approximation
 33: Color Quantization 34: A GSO-Based Swarm Algorithm for Odor Source Localization in Turbulent Environments35: Digital Reputation for Virtual Communities
 36: Approximation for Influence Maximization
 37: Approximation and Heuristics for Community Detection
 Index