Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall CRC Computer & Information Science Series)
โ Scribed by Teofilo F. Gonzalez
- Publisher
- Chapman and Hall/CRC
- Year
- 2007
- Tongue
- English
- Leaves
- 1351
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical applications. It is the first book to comprehensively study both approximation algorithms and metaheuristics. Starting with basic approaches, the handbook presents the methodologies to design and analyze efficient approximation algorithms for a large class of problems, and to establish inapproximability results for another class of problems. It also discusses local search, neural networks, and metaheuristics, as well as multiobjective problems, sensitivity analysis, and stability. After laying this foundation, the book applies the methodologies to classical problems in combinatorial optimization, computational geometry, and graph problems. In addition, it explores large-scale and emerging applications in networks, bioinformatics, VLSI, game theory, and data analysis.Undoubtedly sparking further developments in the field, this handbook provides the essential techniques to apply approximation algorithms and metaheuristics to a wide range of problems in computer science, operations research, computer engineering, and economics. Armed with this information, researchers can design and analyze efficient algorithms to generate near-optimal solutions for a wide range of computational intractable problems.
โฆ Table of Contents
86.2 Color Spaces for Quantization......Page 3
85.4 Design Requirements for a Reputation System......Page 5
86.4 Image-Dependent, Context-Free Quantization......Page 6
85.5.4 Motivation Is Not a Problem: Dissenting Views......Page 8
85.5.5 Other Design Issues......Page 9
85.6.1 Complaints-Based Trust......Page 10
85.7 Conclusions and Future Work......Page 14
References......Page 19
86.1 Introduction......Page 1
85.2 Applications of Reputation Management......Page 2
85.6.2 EigenTrust......Page 11
86.5.2 Feedback-Based Quantization......Page 12
85.6.4 ROCQ......Page 13
References......Page 16
Table of Contents......Page 37
References......Page 15
References......Page 17
Table of Contents......Page 55
85.5.2 Second-Order Reputation......Page 7
Table of Contents......Page 67
86.3 Image-Independent Quantization......Page 4
Table of Contents......Page 81
Table of Contents......Page 97
Table of Contents......Page 108
Table of Contents......Page 119
Table of Contents......Page 135
References......Page 18
Table of Contents......Page 156
Table of Contents......Page 171
Table of Contents......Page 186
Table of Contents......Page 198
51.7.4 Finding Low-Cost kappa-VCSS and kappa-ECSS in Planar Graphs......Page 20
Table of Contents......Page 220
Table of Contents......Page 237
Table of Contents......Page 253
Table of Contents......Page 269
Table of Contents......Page 285
Table of Contents......Page 301
Table of Contents......Page 314
Table of Contents......Page 329
Table of Contents......Page 346
Table of Contents......Page 360
Table of Contents......Page 372
Table of Contents......Page 387
Table of Contents......Page 398
Table of Contents......Page 412
Table of Contents......Page 424
Table of Contents......Page 440
Table of Contents......Page 455
Table of Contents......Page 472
Table of Contents......Page 486
Table of Contents......Page 505
Table of Contents......Page 518
Table of Contents......Page 529
Table of Contents......Page 544
Table of Contents......Page 559
Table of Contents......Page 574
Table of Contents......Page 591
Table of Contents......Page 603
Table of Contents......Page 616
Table of Contents......Page 627
Table of Contents......Page 641
Table of Contents......Page 654
Table of Contents......Page 665
Table of Contents......Page 681
Table of Contents......Page 690
Table of Contents......Page 705
Table of Contents......Page 723
Table of Contents......Page 732
Table of Contents......Page 749
75.3.2.2 A (1 + epsilon) Polynomial-Approximation Scheme......Page 21
Table of Contents......Page 772
Table of Contents......Page 789
Table of Contents......Page 801
Table of Contents......Page 815
Table of Contents......Page 830
Table of Contents......Page 846
Table of Contents......Page 862
Table of Contents......Page 883
Table of Contents......Page 900
Table of Contents......Page 915
Table of Contents......Page 934
Table of Contents......Page 950
Table of Contents......Page 967
Table of Contents......Page 983
Table of Contents......Page 998
Table of Contents......Page 1013
Table of Contents......Page 1033
Table of Contents......Page 1048
Table of Contents......Page 1062
Table of Contents......Page 1073
Table of Contents......Page 1089
Table of Contents......Page 1106
Table of Contents......Page 1122
Table of Contents......Page 1136
References......Page 23
Table of Contents......Page 1161
Table of Contents......Page 1176
Table of Contents......Page 1193
Table of Contents......Page 1207
Table of Contents......Page 1226
Table of Contents......Page 1244
Table of Contents......Page 1264
Table of Contents......Page 1282
Table of Contents......Page 1301
Table of Contents......Page 1319
Table of Contents......Page 1335
๐ SIMILAR VOLUMES
The mystique of biologically inspired (or bioinspired) paradigms is their ability to describe and solve complex relationships from intrinsically very simple initial conditions and with little or no knowledge of the search space. Edited by two prominent, well-respected researchers, the Handbook of Bi
The ability of parallel computing to process large data sets and handle time-consuming operations has resulted in unprecedented advances in biological and scientific computing, modeling, and simulations. Exploring these recent developments, the Handbook of Parallel Computing: Models, Algorithms, and
<p>The <b>Handbook of Data Structures and Applications</b> was first published over a decade ago. This second edition aims to update the first by focusing on areas of research in data structures that have seen significant progress. While the discipline of data structures has not matured as rapidly a
I have been teaching distributed systems and distributed algorithms related courses at graduate level for over 15 years and it is the first time I have come across a book of a favorable context, right measure and length on this topic. This is a formal book on distributed systems using distributed a
Real-time and embedded systems are essential to our lives, from controlling car engines and regulating traffic lights to monitoring plane takeoffs and landings to providing up-to-the-minute stock quotes. Bringing together researchers from both academia and industry, the Handbook of Real-Time and Emb