Corpus ID: 126299597

# Revisiting the Set Cover Conjecture

@article{Krauthgamer2017RevisitingTS,
title={Revisiting the Set Cover Conjecture},
journal={ArXiv},
year={2017},
volume={abs/1711.08041}
}
• Published in ArXiv 2017
• Mathematics, Computer Science
• In the Set Cover problem, the input is a ground set of $n$ elements and a collection of $m$ sets, and the goal is to find the smallest sub-collection of sets whose union is the entire ground set. In spite of extensive effort, the fastest algorithm known for the general case runs in time $O(mn2^n)$ [Fomin et al., WG 2004]. In 2012, as progress seemed to halt, Cygan et al. [TALG 2016] have put forth the Set Cover Conjecture (SeCoCo), which asserts that for every fixed $\varepsilon>0$, no… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 25 REFERENCES

## SETH-Based Lower Bounds for Subset Sum and Bicriteria Path

• Mathematics, Computer Science
• SODA
• 2019

## Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern

• Mathematics, Computer Science
• ArXiv
• 2017

## Narrow sieves for parameterized paths and packings

• Computer Science, Mathematics
• J. Comput. Syst. Sci.
• 2017

## Dynamic Parameterized Problems

• Computer Science, Mathematics
• IPEC
• 2016

## LIMITS and Applications of Group Algebras for Parameterized Problems

• Mathematics, Computer Science
• TALG
• 2016

## On finding rainbow and colorful paths

• Mathematics, Computer Science
• Theor. Comput. Sci.
• 2016

## On the Equivalence among Problems of Bounded Width

• Computer Science, Mathematics
• ESA
• 2015