原书出处
Introduction to Algorithms, Fourth Edition
35 第35章 近似算法
rather slowly, however, this approximation algorithm may nonetheless give useful results.
An instance (X, ℱ) of the set-covering problem consists of a finite set X and a family ℱ of subsets of X, such that every element of X belongs to at least one subset in ℱ: We say that a subfamily C ⊆ ℱ covers a set of elements U if The problem is to find a minimum-size subfamily C ⊆ ℱ whose members cover all of X: Figure 35.3 illustrates the
set-covering problem. The size of C is the number of sets it contains, rather than the nu
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea