原书出处
Introduction to Algorithms, Fourth Edition
35 第35章 近似算法
) // yi ≥ last because L is sorted 6 append yi onto the end of L′ 7 last = yi 8 return L′
Given the procedure TRIM, the procedure APPROX-SUBSET-SUM on the following page implements the approximation scheme. This procedure takes as input a set S = {x1, x2,
… , xn} of n integers (in arbitrary order), the size n = |S|, the target integer t, and a
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea