Improved worst-case complexity for the MIN 3-SET COVERING problem - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2006

Improved worst-case complexity for the MIN 3-SET COVERING problem

Résumé

We consider MIN SET COVERING when the subsets are constrained to have maximum cardinality tree. We propose an exact algorithm whose worst case complexity is bounded above by O* (1.3957n) This is an improvement, based on a refined analysis, of a former result (O*(1.4492n)) by F. Della Croce and V. TH. Paschos, Computing optimal solutions for the MIN 3-SET COVERING problem, Proc. ISSAC'05, LNCS 3827, pp. 685-692.
Fichier principal
Vignette du fichier
cahier_232.pdf (209.41 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00957610 , version 1 (10-03-2014)

Identifiants

  • HAL Id : hal-00957610 , version 1

Citer

Federico Della Croce, Bruno Escoffier, Vangelis Paschos. Improved worst-case complexity for the MIN 3-SET COVERING problem. 2006. ⟨hal-00957610⟩
153 Consultations
110 Téléchargements

Partager

More