Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference39 articles.
1. Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1998). Proof verification and intractability of approximation problems. Journal of the Association for Computing Machinery, 45(3), 501–555.
2. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., & Marchetti-Spaccamela, A. (1999). Complexity and approximation. Combinatorial optimization problems and their approximability properties. Berlin: Springer.
3. Avidor, A., Berkovitch, I., & Zwick, U. (2006). Improved approximation algorithms for MAX NAE-SAT and MAX SAT. In T. Erlebach & G. Persiano (Eds.), Proceedimgs of workshop on approximation and online algorithms, WAOA’05, Lecture notes in computer science (Vol. 3879, pp. 27–40). Springer.
4. Berge, C. (1973). Graphs and hypergraphs. Amsterdam: North Holland.
5. Berman, P., & Fujito, T. (1995). On the approximation properties of independent set problem in degree 3 graphs. In Proceedings of international workshop on algorithms and data structures, WADS’95, Lecture notes in computer science (Vol. 955, pp. 449–460). Springer.