Streaming Algorithms for Extent Problems in High Dimensions-Reference-Cited by-同舟云学术

Streaming Algorithms for Extent Problems in High Dimensions

Published:2013-11-15 Issue:1 Volume:72 Page:83-98
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Agarwal Pankaj K.,Sharathkumar R.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-013-9846-4.pdf

Reference30 articles.

1. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51, 606–635 (2004)

2. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets. In: Goodman, J., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry, pp. 1–30. Cambridge University Press, Cambridge (2005)

3. Agarwal, P.K., Matoušek, J., Suri, S.: Farthest neighbors, maximum spanning trees and related problems in higher dimensions. Comput. Geom. 1, 189–201 (1992)

4. Agarwal, P.K., Yu, H.: A space-optimal data-stream algorithm for coresets in the plane. In: Proceedings of 23rd Annual Symposium on Computational Geometry, pp. 1–10 (2007)

5. Aggarwal, C.: Data Streams: Models and Algorithms. Springer, Berlin (2007)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Streaming Algorithms for Geometric Steiner Forest;ACM Transactions on Algorithms;2024-08-05

2. Static and Streaming Data Structures for Fréchet Distance Queries;ACM Transactions on Algorithms;2023-10-25

3. Streaming Euclidean Max-Cut: Dimension vs Data Reduction;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Covering convex polygons by two congruent disks;Computational Geometry;2023-02

5. High-Dimensional Geometric Streaming in Polynomial Space;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10