Description: presents the heuristic solution of set covering problem-presents the heuristic solution of set covering problem..... Platform: |
Size: 2048 |
Author:akash |
Hits:
Description: 设x1，x2，…xn是实直线上的n个点。用固定长度为k的闭区间覆盖这n个点，至少需要多少个这样的固定长度闭区间？设计此问题的有效算法。
-Set x1, x2, ... xn is a real line on the n points. Fixed length k, closed interval covering the n points, at least the number of such fixed-length closed interval? Design an effective algorithm for this problem. Platform: |
Size: 166912 |
Author:jory |
Hits:
Description: 高维空间球集覆盖问题的改进1_近似算法High dimensional space sphere set covering problem approximation algorithm to improve 1_-High dimensional space sphere set covering problem approximation algorithm to improve 1_ Platform: |
Size: 305152 |
Author:hao5208 |
Hits:
Description: 求解集合覆盖。给定一个实例I = (X , F),X为一个有限集合，F为X的子集的集合，使得X中的每个元素至少属于F中的一个元素，则认为子集F覆盖了X的元素。
集合覆盖问题就是，找出含X的子集个数最少的子集C属于F，使得C覆盖了X中的所有元素。
-For set covering. Given an instance of I = ( X, F ), X is a finite set, F X a subset of the set, so that every element in X at least belong to an F element, that subset F covering X elements.Set cover problem is to find the subset of X, containing a number of at least a subset of C belongs to F, the C covering all elements in the X. Platform: |
Size: 1024 |
Author:liao |
Hits:
Description: 使用贪心算法解决了图论算法中的最大点集覆盖问题-Greedy algorithm using graph theory algorithms to solve the biggest point set covering problem Platform: |
Size: 2048 |
Author:秦志恒 |
Hits:
Search - set covering problem