Author:
Das Gautam,Goodrich Michael T.
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. P. K. Agarwal and S. Suri. Surface approximation and geometric partitions. In Proc. Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994.
2. A. Aggarwal, H. Booth, J. O'Rourke, S. Suri, and C. K. Yap. Finding minimal convex nested polygons. Inform. Comput., 83(1):98–110, October 1989.
3. A. Blum and R. L. Rivest. Training a 3-node neural net is NP-Complete. Neural Networks, 5:117–127, 1992.
4. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 293–302, 1994.
5. K. L. Clarkson. Algorithms for polytope covering and approximation. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 246–252, 1993.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献