Skip to content
  1. CLRS-Lean
  2. Chapters 1–35 · CLRS Fourth Edition
  3. Chapter 35. Approximation Algorithms
  4. 35.5. The Subset-Sum Problem
  5. 35.5. Costed Subset-Sum FPTAS
Browse chapters
Imports
import CLRSLean.FourthEdition.Chapter_35.Section_35_5_The_Subset_Sum_Problem.Costed.Definitions import CLRSLean.FourthEdition.Chapter_35.Section_35_5_The_Subset_Sum_Problem.Costed.LocalCorrectness import CLRSLean.FourthEdition.Chapter_35.Section_35_5_The_Subset_Sum_Problem.Costed.Execution import CLRSLean.FourthEdition.Chapter_35.Section_35_5_The_Subset_Sum_Problem.Costed.Bounds

Costed APPROX-SUBSET-SUM facade

Public entry point for the unit-cost execution, its erasure theorem, and the execution-derived FPTAS work bound for CLRS Section 35.5.