Encyclopedia of algorithms

• Main Author: Kao, Ming-Yang
• Format: eBook Book
• Language: English
• Published: New York, N.Y Springer 2008; Springer US
• Edition: 1
• Series: Springer reference
• Subjects: Algorithms; Algorithms > Encyclopedias; Applications of Mathematics; Artificial Intelligence; Computational Mathematics and Numerical Analysis; Computer Science; Constructive mathematics; Electrical Engineering; Encyclopedias; Theory of Computation

One of Springer's renowned Major Reference Works, this defining reference provides a comprehensive set of solutions to important algorithmic problems for students and researchers. No comparable reference work on this subject is available, making this a genuine must-have for computer scientists.

Table of Contents:

• Intro -- Preface -- Table of Contents -- About the Editor -- Area Editors -- List of Contributors -- A -- B -- C -- D -- E -- F -- G -- H -- I -- K -- L -- M -- N -- O -- P -- Q -- R -- S -- T -- U -- V -- W -- X -- Chronological Index -- Bibliography -- Index
• Geographic Routing -- Geometric Computing -- Geometric Dilation of Geometric Networks -- Geometric Spanners -- Gomory-Hu Trees -- Graph Bandwidth -- Graph Coloring -- Graph Connectivity -- Graph Isomorphism -- Graphs -- Greedy Approximation Algorithms -- Greedy Set-Cover Algorithms -- H -- Hamilton Cycles in Random Intersection Graphs -- Hardness of Proper Learning -- High Performance Algorithm Engineering for Large-scale Problems -- Hitting Set -- Hospitals/Residents Problem -- I -- Implementation Challenge for Shortest Paths -- Implementation Challenge for TSP Heuristics -- Implementing Shared Registers in Asynchronous Message-Passing Systems -- Incentive Compatible Algorithms -- Incentive Compatible Selection -- Incremental Algorithms -- Independent Sets in Random Intersection Graphs -- Indexed Approximate String Matching -- Inductive Inference -- I/O-model -- K -- Kinetic Data Structures -- Knapsack -- L -- Learning with the Aid of an Oracle -- Learning Automata -- Learning Constant-Depth Circuits -- Learning DNF Formulas -- Learning Heavy Fourier Coefficients of Boolean Functions -- Learning with Malicious Noise -- Learning Significant Fourier Coefficients over Finite Abelian Groups -- LEDA: a Library of Efficient Algorithms -- Leontief Economy Equilibrium -- Linearity Testing/ Testing Hadamard Codes -- Linearizability -- List Decoding near Capacity: Folded RS Codes -- List Scheduling -- Load Balancing -- Local Alignment (with Affine Gap Weights) -- Local Alignment (with Concave Gap Weights) -- Local Approximation of Covering and Packing Problems -- Local Computation in Unstructured Radio Networks -- Local Search Algorithms for kSAT -- Local Search for K-medians and Facility Location -- Location-Based Routing -- Lower Bounds for Dynamic Connectivity -- Low Stretch Spanning Trees -- LP Decoding -- M -- Majority Equilibrium
• Packet Routing
• Market Games and Content Distribution -- Max Cut -- Maximum Agreement Subtree (of 2 Binary Trees) -- Maximum Agreement Subtree (of 3 or More Trees) -- Maximum Agreement Supertree -- Maximum Compatible Tree -- Maximum-Density Segment -- Maximum Matching -- Maximum-scoring Segment with Length Restrictions -- Maximum Two-Satisfiability -- Max Leaf Spanning Tree -- Metrical Task Systems -- Metric TSP -- Minimum Bisection -- Minimum Congestion Redundant Assignments -- Minimum Energy Broadcasting in Wireless Geometric Networks -- Minimum Energy Cost Broadcasting in Wireless Networks -- Minimum Flow Time -- Minimum Geometric Spanning Trees -- Minimum k-Connected Geometric Networks -- Minimum Makespan on Unrelated Machines -- Minimum Spanning Trees -- Minimum Weighted Completion Time -- Minimum Weight Triangulation -- Mobile Agents and Exploration -- MST -- Multicommodity Flow, Well-linked Terminals and Routing Problems -- Multicut -- Multidimensional Compressed Pattern Matching -- Multidimensional String Matching -- Multi-Hop Radio Networks, Ad Hoc Networks -- Multi-level Feedback Queues -- Multiple String Alignment -- Multiple Unit Auctions with Budget Constraint -- Multiplex PCR for Gap Closing (Whole-genome Assembly) -- Multiway Cut -- N -- Nash Equilibria and Dominant Strategies in Routing -- Navigation -- Nearest Neighbor Interchange and Related Distances -- Negative Cycles in Weighted Digraphs -- Non-approximability of Bimatrix Nash Equilibria -- Non-shared Edges -- Nucleolus -- O -- Oblivious Routing -- Obstacle Avoidance Algorithms in Wireless Sensor Networks -- O(log log n)-competitive Binary Search Tree -- Online Interval Coloring -- Online Learning -- Online List Update -- Online Paging and Caching -- Online Scheduling -- Optimal Probabilistic Synchronous Byzantine Agreement -- Optimal Radius -- Optimal Stable Marriage -- P -- P2P
• Intro -- Preface -- Table of Contents -- About the Editor -- Area Editors -- List of Contributors -- A -- Abelian Hidden Subgroup Problem -- Adaptive Partitions -- Ad-Hoc Networks -- Adword Auction -- Adwords Pricing -- Agreement -- Algorithm DC-Tree for k Servers on Trees -- Algorithmic Cooling -- Algorithmic Mechanism Design -- Algorithms for Spanners in Weighted Graphs -- All Pairs Shortest Paths in Sparse Graphs -- All Pairs Shortest Paths via Matrix Multiplication -- Alternative Performance Measures in Online Algorithms -- Analyzing Cache Misses -- Applications of Geometric Spanner Networks -- Approximate Dictionaries -- Approximate Dictionary Matching -- Approximate Maximum Flow Construction -- Approximate Membership -- Approximate Nash Equilibrium -- Approximate Periodicities -- Approximate Regular Expression Matching -- Approximate Repetitions -- Approximate Tandem Repeats -- Approximating Metric Spaces by Tree Metrics -- Approximation Algorithm -- Approximation Algorithm Design -- Approximation Algorithms -- Approximation Algorithms in Planar Graphs -- Approximations of Bimatrix Nash Equilibria -- Approximation Schemes for Bin Packing -- Approximation Schemes for Planar Graph Problems -- Arbitrage in Frictional Foreign Exchange Market -- Arithmetic Coding for Data Compression -- Assignment Problem -- Asynchronous Consensus Impossibility -- Atomic Broadcast -- Atomicity -- Atomic Multicast -- Atomic Network Congestion Games -- Atomic Scan -- Atomic Selfish Flows -- Attribute-Efficient Learning -- Automated Search Tree Generation -- B -- Backtracking Based k-SAT Algorithms -- Best Response Algorithms for Selfish Routing -- Bidimensionality -- Binary Decision Graph -- Bin Packing -- Block Edit Distance -- Block-Sorting Data Compression -- Boolean Formulas -- Boolean Satisfiability -- Boosting Textual Compression
• Branchwidth of Graphs -- Broadcasting in Geometric Radio Networks -- B-trees -- Buffering -- Burrows-Wheeler Transform -- Byzantine Agreement -- C -- Cache-Oblivious B-Tree -- Cache-Oblivious Model -- Cache-Oblivious Sorting -- Caching -- Causal Order, Logical Clocks, State Machine Replication -- Certificate Complexity and Exact Learning -- Channel Assignment and Routing in Multi-Radio Wireless Mesh Networks -- Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach -- Circuit Placement -- Circuit Retiming -- Circuit Retiming: An Incremental Approach -- Clock Synchronization -- Closest String and Substring Problems -- Closest Substring -- Clustering -- Color Coding -- Communication in Ad Hoc Mobile Networks Using Random Walks -- Competitive Auction -- Complexity of Bimatrix Nash Equilibria -- Complexity of Core -- Compressed PatternMatching -- Compressed Suffix Array -- Compressed Text Indexing -- Compressing Integer Sequences and Sets -- Compression -- Computational Learning -- Computing Pure Equilibria in the Game of Parallel Links -- Concurrent Programming, Mutual Exclusion -- Connected Dominating Set -- Connectivity and Fault-Tolerance in Random Regular Graphs -- Consensus with Partial Synchrony -- Constructing a Galled Phylogenetic Network -- Coordination Ratio -- CPU Time Pricing -- Critical Range for Wireless Networks -- Cryptographic Hardness of Learning -- Cuckoo Hashing -- D -- Data Migration -- Data Reduction for Domination in Graphs -- Decoding -- Decoding Reed-Solomon Codes -- Decremental All-Pairs Shortest Paths -- Degree-Bounded Planar Spanner with Low Weight -- Degree-Bounded Trees -- Deterministic Broadcasting in Radio Networks -- Deterministic Searching on the Line -- Detour -- Dictionary-Based Data Compression -- Dictionary Matching and Indexing (Exact and with Errors) -- Dilation -- Dilation of Geometric Networks
• Directed Perfect Phylogeny (Binary Characters) -- Direct Routing Algorithms -- Distance-Based Phylogeny Reconstruction (Fast-Converging) -- Distance-Based Phylogeny Reconstruction (Optimal Radius) -- Distributed Algorithms for Minimum Spanning Trees -- Distributed Computing -- Distributed Vertex Coloring -- Dominating Set -- Dynamic Problems -- Dynamic Trees -- E -- Edit Distance Under Block Operations -- Efficient Methods for Multiple Sequence Alignment with Guaranteed Error Bounds -- Engineering Algorithms for Computational Biology -- Engineering Algorithms for Large Network Applications -- Engineering Geometric Algorithms -- Equivalence Between Priority Queues and Sorting -- Error-Control Codes, Reed-Muller Code -- Error Correction -- Euclidean Graphs and Trees -- Euclidean Traveling Salesperson Problem -- Exact Algorithms for Dominating Set -- Exact Algorithms for General CNF SAT -- Exact Graph Coloring Using Inclusion-Exclusion -- Experimental Methods for Algorithm Analysis -- External Memory -- External Sorting and Permuting -- Extremal Problems -- F -- Facility Location -- Failure Detectors -- False-Name-Proof Auction -- Fast Minimal Triangulation -- Fault-Tolerant Quantum Computation -- File Caching and Sharing -- Floorplan and Placement -- Flow Time Minimization -- Formal Methods -- FPGA Technology Mapping -- Fractional Packing and Covering Problems -- Full-Text Index Construction -- Fully Dynamic All Pairs Shortest Paths -- Fully Dynamic Connectivity -- Fully Dynamic Connectivity: Upper and Lower Bounds -- Fully Dynamic Higher Connectivity -- Fully Dynamic Higher Connectivity for Planar Graphs -- Fully Dynamic Minimum Spanning Trees -- Fully Dynamic Planarity Testing -- Fully Dynamic Transitive Closure -- G -- Gate Sizing -- General Equilibrium -- Generalized Steiner Network -- Generalized Two-Server Problem -- Generalized Vickrey Auction