Category: Blog
-
Hirschberg’s Algorithm | Linear-Space LCS Learning Guide
A Learning Hall guide to Hirschberg’s algorithm, from LCS dynamic programming through forward/reverse midpoint rows, divide-and-conquer reconstruction, linear-space alignment and professional testing.
-
How to Learn Suurballe’s Algorithm: Reweighting, Residual Graphs, Edge-Disjoint Shortest Paths and Resilient Routing
A Learning Hall guide to Suurballe’s algorithm from shortest-path foundations through reweighting, residual cancellation, edge-disjoint routing, correctness, complexity and production verification.
-
How to Learn the Frank–Wolfe Algorithm: Linear Minimization Oracles, Duality Gaps, Projection-Free Optimization and Sparse Iterates
A Learning Hall guide to Frank–Wolfe from convex geometry and linearization through step sizes, duality gaps, convergence, away-step variants and professional projection-free optimization.
-
How to Learn the Package-Merge Algorithm: Length-Limited Huffman Coding, Coin-Collector Reduction, Code-Length Bounds and Production Compression
A Learning Hall guide to Package-Merge from Huffman coding foundations through the binary coin-collector reduction, optimal length limits, canonical codes and production compression constraints.
-
Boyer–Myrvold Planarity Testing | Graph Algorithms Learning Guide
A Learning Hall guide to Boyer–Myrvold planarity testing from planar graph intuition and DFS structure through embeddings, obstruction certificates, linear-time reasoning and production verification.
-
How to Learn ADMM: Variable Splitting, Augmented Lagrangians, Primal/Dual Residuals and Distributed Convex Optimization
A Learning Hall guide to ADMM, from variable splitting and augmented Lagrangians through proximal updates, primal/dual residuals, penalty tuning and distributed convex optimization.
