Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference45 articles.
1. Hardness of approximation;Arora,1997
2. T. Asano, D.P. Williamson, Improved approximation algorithms for MAX SAT, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’00, 2000, pp. 96–105.
3. Upper bounds for MaxSat: further improved;Bansal,1999
4. R. Battiti, M. Protassi, Reactive search, a history-sensitive heuristic for MAX-SAT, ACM J. Exp. Algorithmics 2 (1997) (Paper 2).
5. R. Battiti, M. Protasi, Approximate algorithms and heuristics for MAX-SAT, in: Handbook of Combinatorial Optimization, Vol. 1, Kluwer Academic Publishers, Dordrecht, 1998, pp. 77–148.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献