arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1305.3584cs.DScs.DM
收藏

关于集合覆盖和集合包装的贪婪启发式算法

New Greedy Heuristics For Set Cover and Set Packing

David Kordalewski

摘要:

集合覆盖问题(SCP)和集合装箱问题(SPP)是典型的NP难组合优化问题。他们的决策问题版本在Karp的1972年论文中被证明是NP完全的。我们指定了一个粗略的指南,以构建近似算法,可能有广泛的应用,并将其应用于设计贪婪的近似算法SCP和SPP,其中的选择启发式是在标准的贪婪近似算法的变化。我们的技术包括为每个输入集分配一个估值,然后在每一轮中选择估值最高的集合。我们证明,我们使用的技术来确定输入集的估值产生一个唯一的值为所有集覆盖实例。对于SCP和SPP,我们给出了实验证据,我们指定的估值是唯一的,可以通过迭代算法快速计算到高精度。其他人已经尝试测试各种算法在各种随机生成的实例上观察到的近似比,我们有大量的实验证据来证明新算法相对于常用贪婪算法的质量。我们的算法比标准的算法计算量更大,尽管它们对于大型实例仍然是实用的。我们讨论了一些方法来加快我们的算法,不显着扭曲其有效性在实践中的随机实例。

英文摘要:

The Set Cover problem (SCP) and Set Packing problem (SPP) are standard NP-hard combinatorial optimization problems. Their decision problem versions are shown to be NP-Complete in Karp's 1972 paper. We specify a rough guide to constructing approximation heuristics that may have widespread applications and apply it to devise greedy approximation algorithms for SCP and SPP, where the selection heuristic is a variation of that in the standard greedy approximation algorithm. Our technique involves assigning to each input set a valuation and then selecting, in each round, the set whose valuation is highest. We prove that the technique we use for determining a valuation of the input sets yields a unique value for all Set Cover instances. For both SCP and SPP we give experimental evidence that the valuations we specify are unique and can be computed to high precision quickly by an iterative algorithm. Others have experimented with testing the observed approximation ratio of various algorithms over a variety of randomly generated instances, and we have extensive experimental evidence to show the quality of the new algorithm relative to greedy heuristics in common use. Our algorithms are somewhat more computationally intensive than the standard heuristics, though they are still practical for large instances. We discuss some ways to speed up our algorithms that do not significantly distort their effectiveness in practice on random instances.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑