1. On the complexity of approximating the independent set problem;Berman;Proc. 6th Annual Symposium on Theoretical Aspects of Computer Science,1989
2. Worst-case analysis of a new heuristic for the travelling salesman problem;Christofides,1976
3. Computers and Intractability: A Guide to the Theory of NP-completeness;Garey,1979
4. An efficient approximation scheme for the one-dimensional bin packing problem;Karmakar;Proc. 23rd Annual Symposium on Foundations of Computer Science,1982
5. Optimization, approximation and complexity classes;Papadimitriou;Proc. 20th Annual ACM Symposium on Theory of Computing,1988