Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Noga Alon and Joel H. Spencer. The Probabilistic Method. Wiley, New York, 1992.
2. Gunnar Andersson, Lars Engebretsen, and Johan Håstad. A new way to use semidefinite programming with applications to linear equations mod p. In Proc. Tenth Ann. ACM-SIAM Symp. on Discrete Algorithms, 1999.
3. Alan Frieze and Mark Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. In Proc. 4th Conf. on Integer Prog. and Combinatorial Optimization, volume 920 of Lecture Notes in Comput. Sci., pages 1–13, Berlin, 1995. Springer-Verlag.
4. Michel X. Goemans and David P. Williamson. 878-approximation algorithms for MAX CUT and MAX 2SAT. In Proc. Twenty-sixth Ann. ACM Symp. on Theory of Comp., pages 422–431. ACM, New York, 1994.
5. Johan Håstad. Some optimal inapproximability results. In Proc. Twenty-nineth Ann. ACM Symp. on Theory of Comp., pages 1–10. ACM, New York, 1997.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献