An Improvement and Analysis of a Heuristic Algorithm of the Minimum Set Covering Problem
碩士 === 國立清華大學 === 通訊工程研究所 === 95 === We have proposed a heuristic algorithm of the minimal set covering problem in our previous work about the Link Failure Detection, and proved that the algorithm is superior to the Greedy algorithm in solving the minimal set covering problem incurred from the Link...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/50471201604466022997 |