Result: Computing optimal solutions for the MIN 3-SET COVERING problem
Title:
Computing optimal solutions for the MIN 3-SET COVERING problem
Authors:
Source:
Algorithms and computation (16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005)0ISAAC 2005. :685-692
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 9 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Couverture, Coverage, Cobertura, Méthode cas pire, Worst case method, Método caso peor, Nombre cardinal, Cardinal number, Número cardinal, Problème recouvrement, Covering problem, Problema recubrimiento, Recouvrement ensemble, Set covering, Cubierta conjunto, Solution optimale, Optimal solution, Solución óptima
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
D.A.I., Politecnico di Torino, Italy
LAMSADE, CNRS UMR 7024 and Université Paris-Dauphine, France
LAMSADE, CNRS UMR 7024 and Université Paris-Dauphine, France
ISSN:
0302-9743
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17394443
Database:
PASCAL Archive
Further Information
We consider MIN SET COVERING when the subsets are constrained to have maximum cardinality three. We propose an exact algorithm whose worst case complexity is bounded above by O* (1.4492n).