Inscriere cercetatori

Daca aveti cont Ad Astra si de Facebook, intrati pe pagina de profil pentru a da dreptul sa va logati pe site doar cu acest buton.

Site nou !

Daca nu va puteti recupera parola (sau aveti alte probleme), scrieti-ne la pagina de contact. Situl vechi se gaseste la adresa old.ad-astra.ro

Facebook

Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem

Domenii publicaţii > Ştiinţe informatice + Tipuri publicaţii > Articol în revistã ştiinţificã

Autori: C. Bonchis and G. Istrate

Editorial: Information Processing Letters, 114(7), p.360–365, 2014.

Rezumat:

Want create site? Find Free WordPress Themes and plugins.

We study the approximability of instances of the minimum entropy set cover problem, parameterized by the average frequency of a random element in the covering sets. We analyze an algorithm combining a greedy approach with another one biased towards large sets. The algorithm is controlled by the percentage of elements to which we apply the biased approach. The optimal parameter choice leads to improved approximation guarantees when average element frequency is less than e.

Did you find apk for android? You can find new Free Android Games and apps.

Cuvinte cheie: Entropy, Set cover, Approximation algorithms

URL: http://www.sciencedirect.com/science/article/pii/S0020019014000246