Author:
Gupta Himanshu,Srivastava Divesh
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. In Proceedings of the Foundations of Computer Science, 1993.
2. S. Arora and C. Lund. Hardness of approximations. Technical Report TR-504-95, Princeton University, Computer Science Department, 1995.
3. B. Chazelle. Filtering search: A new approach to query-answering. In Proceeding of the Foundations of Computer Science, 1983.
4. V. Chvatal. A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4(3):233–235, 1979.
5. H. Edelsbrunner. A new approach to rectangle intersections, Part I. International Journal of Computer Mathematics, 13:209–219, 1983.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献