Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference19 articles.
1. Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7, 567–683 (1986)
2. Andersson, G., Engebretsen, L.: Better approximation algorithms and tighter analysis for set splitting and not-all-equal Sat. In: ECCCTR: Electronic Colloquium on Computational Complexity (1997)
3. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)
4. Chen, J., Kanj, I.: Improved exact algorithms for Max-Sat. Discrete Appl. Math. 142, 17–27 (2004)
5. Chen, J., Lu, S.: Improved algorithm for weighted and unweighted set splitting problems. In: COCOON 2007. Lecture Notes in Computer Science, vol. 4598, pp. 573–547 (2007)
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献