The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Assume that there exists a collection C of subsets of a finite set S, and a positive integer K⩽∣S∣, and we need to know whether there is a subset S′⊆S with ∣S′∣⩽K such that S′ contains at least one element of each subset in C. In other words, S′ is the subset that intersects every subset in C and is called the hitting-set. In this paper, a DNA-based algorithm is proposed to solve the small hitting-set...
The hitting-set problem is an NP-complete problem in set theory. Assume that we have collection C of subsets of a finite set S, and a positive integer K les |S|, and we would like to know if there is a subset S' sube S with |S'| les K such that S' hits (contains) at least one element from each subset in C. In this paper, the DNA-based algorithm is proposed to solve the hitting-set problem. Furthermore,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.