Author:
Yildirim E. Alper,Fan-Orzechowski Xiaofei
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference25 articles.
1. F. Alizadeh, “A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs,” ACM-SIAM Symposium on Discrete Algorithms, vol. 2, pp. 188–194, 1991.
2. N. Alon and N. Kahale, “Approximating the independence number via the theta-function,” Mathematical Programming, vol. 80, no. 3. pp. 253–264, 1998.
3. H.Y. Benson and R.J. Vanderbei, “Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming,” Mathematical Programming, vol. 95, no. 2, pp. 279–302, 2003.
4. S. Benson and Y. Ye, “Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation,” in Applications and Algorithms of Complementarity, M. Ferris and J. Pang (Eds.), Kluwer Academic Publishers, 2000, pp. 1–18.
5. C. Berge, “Färbung von graphen deren sämtliche beziehungsweise deren ungerade kreise starr sind (zusammenfassung),” Wissenschaftliche Zeitschrift, Martin Luther Univ. Halle-Wittenberg, Math.-Naturwiss. Reihe, pp. 114–115, 1961.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献