Computing optimal solutions for the MIN 3-SET COVERING problem

Authors:
Federico Della Croce;Vangelis Th. Paschos
Affiliations:
D.A.I., Politecnico di Torino, Italy;LAMSADE, CNRS UMR 7024 and Université Paris-Dauphine, France
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 6
Cited 1

Finding maximum independent sets in sparse and general graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Vertex cover: further observations and further improvements

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
Graphs and Hypergraphs

Graphs and Hypergraphs

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

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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).