The communication complexity of approximate set packing and covering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 868-875

  Nisan, Noam ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY;

COMMUNICATION COMPLEXITY; SET PACKING;

POLYNOMIAL APPROXIMATION;

EID: 84869159580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_74     Document Type: Conference Paper

References (13)

1. R. Aharoni, P. Erods, and N. Linial. Optima of dual integer linear programs. Combinatorica, 8, 1988.
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.
3. V. Chvatal. A greedy heuristic for the set covering problem. Math. Operations Reserach, 4:233-235, 1979.
4. 1-ε. Acta Mathematica, 182, 1999.
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.
6. L. Lov'asz. The ratio of optimal integral and fractional covers. Discrete Mathematics, 13, 1975.
7. Carsten Lund and Mihalis Yannakakis. On the hardness of approximatingminimization problems. In Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, pages 286-293, 1993.
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. A. A. Razborov. On the distributional complexity of disjointness. In ICALP, 1990.
10. T. Sandholm, S. Suri, A. Gilpin, and Levine D. Cabob: A fast optimal algorithm for combinatorial auctions. In IJCAI, 2001.
11. Rakesh Vohra and Sven de Vries. Combinatorial auctions: A survey, 2000. Availailabe from http://www.kellogg.nwu.edu/faculty/vohra/htm/res.htm.
12. Andrew Chi-Chih Yao. Some complexity questions related to distributive computing. In ACM Symposium on Theory of Computing, pages 209-213, 1979.
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.