Almost Optimal Streaming Algorithms for Coverage Problems-Reference-Cited by-同舟云学术

Almost Optimal Streaming Algorithms for Coverage Problems

Published:2017-07-24 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Bateni MohammadHossein¹,Esfandiari Hossein²,Mirrokni Vahab¹

Affiliation:

1. Google Research, New York, NY, USA

2. University of Maryland, College Park, MD, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3087556.3087585

Reference45 articles.

1. Diversity maximization under matroid constraints

2. Graph Sparsification in the Semi-streaming Model

3. K. J. Ahn and S. Guha. Laminar families and metric embeddings: Non-bipartite maximum matching problem in the semi-streaming model. Manuscript available at http://arxiv.org/abs/1104.4058 2011. K. J. Ahn and S. Guha. Laminar families and metric embeddings: Non-bipartite maximum matching problem in the semi-streaming model. Manuscript available at http://arxiv.org/abs/1104.4058 2011.

4. Spectral Sparsification in Dynamic Graph Streams

5. A. Andoni A. Gupta and R. Krauthgamer. Towards (1 A. Andoni A. Gupta and R. Krauthgamer. Towards (1

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

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

2. Set Cover in the One-pass Edge-arrival Streaming Model;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18

3. FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective;SIAM Journal on Discrete Mathematics;2023-06-15

4. Seeding with Costly Network Information;Operations Research;2022-07

5. Submodular Maximization Subject to a Knapsack Constraint Under Noise Models;Asia-Pacific Journal of Operational Research;2022-04-18