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

Authors:
Federico Della Croce;Bruno Escoffier;Vangelis Th. Paschos
Affiliations:
D.A.I., Politecnico di Torino, Italy;LAMSADE, CNRS UMR 7024 and Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cédex 16, France;LAMSADE, CNRS UMR 7024 and Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cédex 16, France
Venue:
Operations Research Letters
Year:
2007

Citing 8
Cited 0

Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete 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
Pathwidth of cubic graphs and exact algorithms

Information Processing Letters
3-coloring in time O (1.3289n)

Journal of Algorithms
Measure and conquer: domination – a case study

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computing optimal solutions for the MIN 3-SET COVERING problem

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider MIN SET COVERING when the subsets are constrained to have maximum cardinality 3. We propose an exact algorithm whose worst-case complexity is bounded above by O^*(1.3957^m), where m is the number of sets in the instance. This result improves upon the previously known bound of O^*(1.4391^m).