The Relationship between the Unicost Set Covering Problem and the Attribute Reduction Problem in Rough Set Theory

Qingyuan Xu and Jinjin Li

Mathematical Problems in Engineering, 2020, vol. 2020, 1-12

Abstract:

The unicost set covering problem and the attribute reduction problem are NP-complete problems. In this paper, the relationship between these two problems are discussed. Based on the transformability between attribute reductions and minimal solutions in unicost set covering models, two methods are provided. One is to induce an information table from a given unicost set covering model. With no doubt, it shows that the unicost set covering problem can be investigated by rough set theory. The other is to induce a unicost set covering model from a given information table. Similarly, it shows that the attribute reduction problem can be studied by set covering theory. As an application of the proposed theoretical results, a rough set heuristic algorithm is presented for the unicost set covering problem.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/5359691.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/5359691.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5359691

DOI: 10.1155/2020/5359691

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().