On the complexity of approximating k-dimensional matching

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

Volumn 2764, Issue , 2003, Pages 83-97

  Hazan, Elad ^a   Safra, Shmuel ^b   Schwartz, Oded ^b  

^a Princeton University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

CLAW-FREE GRAPHS; GRAPH PROBLEMS; HYPER GRAPH; K-PARTITE; MAXIMAL MATCHINGS; MAXIMUM INDEPENDENT SETS; NP-HARDNESS; SET PACKING;

APPROXIMATION ALGORITHMS;

EID: 35248817378     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_8     Document Type: Article

References (24)

1. N. Alon, U. Fiege, A. Wigderson, and D. Zuckerman. Derandomized graph products. Computational Complexity, 5:60-75, 1995.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 13-22, 1992.
3. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. In Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 2-13, 1992.
4. P. Berman and M. Furer. Approximating maximum independent set in bounded degree graphs. SODA, pages 365-371, 1994.
5. P. Berman and T. Fujito. On the approximation properties of independent set problem in degree 3 graphs. WADS, pages 449-460, 1995.
6. R. Boppana and Magnus M. Halldorsson. Approximating maximum independent sets by excluding subgraphs. Bit 32, pages 180-196, 1992.
7. P. Berman and M. Karpinski. On some tighter inapproximability results. DIMACS Technical Report 99-23, 1999.
8. Piotr Berman and Marek Karpinski. Improved approximation lower bounds on small occurrence optimization. ECCC TR03-008, 2003.
9. R. Bar-Yehuda and S. Moran. On approximation problems related to the independent set and vertex cover problems. Discrete Applied Mathematics, 9:1-10, 1984.
10. M. Chlebik and J. Chlebikova. Approximation hardness for small occurrence instances of NP-hard problems. ECCC TR02-073, 2002.
11. M. Chlebik and J. Chlebikova. Inapproximability results for bounded variants of optimization problems. ECCC TR03-026, 2003.
12. J. Edmonds. Paths, trees and flowers. Canadian Journal of Mathematics, 17:449-467, 1965.
13. Magnus M. Halldorsson. Approximations of independent sets in graphs. APPROX, 1998.
14. Johan Håstad. Some optimal inapproximability results. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 1-10, El Paso, Texas, 4-6 May 1997.
15. 1-ε. Acta Math., 182(1):105-142, 1999.
16. C. A. J. Hurkens and A. Schrijver. On the size of systems of sets every t of which have an sdr, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal Discrete Math, 2:68-72, 1989.
17. V. Kann. Maximum bounded 3-dimensional matching is MAXSNP-complete. Information Processing Letters, 37:27-35, 1991.
18. R. M. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations, pages 83-103, 1972.
19. C. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
20. E. Petrank. The hardness of approximation - gap location. Israel Symposium on Theory of Computing Systems, 1994.
21. J. Radhakrishnan and A. Ta-Shma. Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics, 13:2-24, 2000.
22. L. Trevisan. Non-approximability results for optimization problems on bounded degree instances. In Proc. of the 33rd ACM STOC, 2001.
23. S. Vishwanathan. Personal communication to m. halldorsson cited in [Hal98]. 1996.
24. A. Wigderson. Improving the performance guarantee for approximate graph coloring. Journal of the Association for Computing Machinery, 30(4):729-735, 1983.