Author:
Gusfield Dan,Pitt Leonard
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference22 articles.
1. G. Ausiello, A. D'Atri, and M. Protasi. Structure preserving reductions among convex optimization problems.J. Comput. System Sci.,21 (1980), 136–153.
2. R. Bar-Yehuda and S. Even. A linear time approximation algorithm for the weighted vertexcover problem.J. Algorithms,2 (1981), 198–203.
3. R. Bar-Yehuda and S. Even. A local ratio theorem for approximating the weighted vertex-cover problem.Ann. Discrete Math.,25 (1985), 27–46.
4. S. A. Cook. The complexity of theorem proving procedures. InProceedings of the 3rd Annual ACM Symposium on Theory of Computing, New York, 1971. Association Computing Machinery, New York, pp. 151–158.
5. S. A. Cook and M. Luby. A simple parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula.Inform. Process. Lett.,27 (1988), 141–145.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献