Subject
Computer Science Applications,General Mathematics,Software
Reference22 articles.
1. Improved parallel approximation of a class of integer programming problems
2. S. Arora, D. Karger, and M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems. Proceedings of the twenty-seventh annual ACM Symposium on Theory of Computing (STOC '95)58(1995) 284–293, ACM Press.
3. S. Arora, A. Frieze, and H. Kaplan, A new rounding procedure for the assignment problem with applications to dense graph arrangement problems, inProcedings of the FOCS'96(1996) 21–30.
4. Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
5. M.R. Garey, and D.S. Johnson,Computers and Intractability – A Guide to the Theory of NP-Completeness. W.H. Freeman and Co. (1979).