Hardness of Set Cover with Intersection 1

@inproceedings{Kumar2000HardnessOS,
  title={Hardness of Set Cover with Intersection 1},
  author={V. S. Anil Kumar and Sunil Arya and H. Ramesh},
  booktitle={ICALP},
  year={2000}
}
We consider a restricted version of the general Set Covering problem in which each set in the given set system intersects with any other set in at most 1 element. We show that the Set Covering problem with intersection 1 cannot be approximated within a o(log n) factor in random polynomial time unless N P ZT IM E(n O(log log n)). We also observe that the main challenge in derandomizing this reduction lies in nd a hitting set for large volume combinatorial rectangles satisfying certain… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 42 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 13 references

A Parallel Repetition Theorem

SIAM J. Comput. • 1998

EÆ ient Probabilisti ally Che kable Proofs and Appli ations to Approximation

M. Bellare, S. Goldwasser, C. Lund, A. Russell
Pro eedings of 25th ACM Symposium on Theory of Computing, • 1993

Hitting Sets for Combinatorial Re tangles

N. Linial, M. Luby, M. Saks, D. Zu kerman
Pro eedings of 25 ACM Symposium on Theory of Computing, • 1993

A New Method for Image om pression using Irredu ible Covers of Maximal Re tangles

Y. Cheng, S. S. Iyengar, R. L. Kashyap
IEEE Transa tions on Software Engineering, • 1988

Similar Papers

Loading similar papers…