知识卡片
集合覆盖选最少子集
集合覆盖给定元素集合X与覆盖每个元素的子集族F,目标从F中选尽量少的子集,使其并集包含整个X。
目标规模数的是子集个数,不是被覆盖元素个数;给定上限k的版本是判定问题。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第35章 近似算法 · 查看原书依据
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
参考来源
- 位置:《算法导论(第4版)》第35章《近似算法》(OEBPS/chapter035.xhtml,文本字符[25000,30000))。
- 结论依据:第35章无三角约束旅行商、集合覆盖与随机近似、线性松弛的原文论证;图35.3已核对。
- 原始内容: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