The Communication Complexity of Approximate Set Packing and Covering

  • Noam Nisan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2380)

Abstract

We consider a setting where k players are each holding some collection of subsets of 1..n. We consider the communication complexity of approximately solving two problems: The cover number: the minimal number of sets (in the union of their collections) whose union is 1...n and the packing number: the maximum number of sets (in the union of their collections) that are pair-wise disjoint.

We prove that while computing a (ln n)-approximation for the cover number and an min(k, O(√n))-approximation for the packing number can be done with polynomial (in n) amount of communication, getting a (1/2 − ε) logn approximation for the cover number or a better than min(k, n 1/2 − ε)-approximation for the packing number requires exponential communication complexity.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Aharoni, P. Erods, and N. Linial. Optima of dual integer linear programs. Combinatorica, 8, 1988.Google Scholar
  2. 2.
    N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1):137–137, 1999.MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    V. Chvatal. A greedy heuristic for the set covering problem. Math. Operations Reserach, 4:233–235, 1979.MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Johan Hastad. Clique is hard to approximate to within n1 − ε. Acta Mathematica, 182, 1999.Google Scholar
  5. 5.
    Daniel Lehmann, Liadan Ita O’Callaghan, and Yoav Shoham. Truth revelation in rapid, approximately efficient combinatorial auctions. In 1st ACM conference on electronic commerce, 1999.Google Scholar
  6. 6.
    L. Lov’asz. The ratio of optimal integral and fractional covers. Discrete Mathematics, 13, 1975.Google Scholar
  7. 7.
    Carsten Lund and Mihalis Yannakakis. On the hardness of approximating minimization problems. In Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, pages 286–293, 1993.Google Scholar
  8. 8.
    Noam Nisan and Ilya Segal. The communication complexity of efficient allocation problems, 2001. Preliminary version available from http://www.cs.huji.ac.il/noam/mkts.html.
  9. 9.
    A. A. Razborov. On the distributional complexity of disjointness. In ICALP, 1990.Google Scholar
  10. 10.
    T. Sandholm, S. Suri, A. Gilpin, and Levine D. Cabob: A fast optimal algorithm for combinatorial auctions. In IJCAI, 2001.Google Scholar
  11. 11.
    Rakesh Vohra and Sven de Vries. Combinatorial auctions: A survey, 2000. Availail-abe from http://www.kellogg.nwu.edu/faculty/vohra/htm/res.htm.
  12. 12.
    Andrew Chi-Chih Yao. Some complexity questions related to distributive computing. In ACM Symposium on Theory of Computing, pages 209–213, 1979.Google Scholar
  13. 13.
    Edo Zurel and Noam Nisan. An efficient approximate allocation algorithm for combinatorial auctions. In ACM conference onelectronic commerce, 2001. Available from http://www.cs.huji.ac.il/noam/mkts.html.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Noam Nisan
    • 1
  1. 1.Institute of Computer ScienceThe Hebrew University of JerusalemIsrael

Personalised recommendations