Maximum coverage in the data stream model: parameterized and generalized
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 6905172 (Why is no real title available?)
- scientific article; zbMATH DE number 5764844 (Why is no real title available?)
- scientific article; zbMATH DE number 2019620 (Why is no real title available?)
- scientific article; zbMATH DE number 7053293 (Why is no real title available?)
- A 4.31-approximation for the geometric unique coverage problem on unit disks
- A note on max k-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation
- A threshold of ln n for approximating set cover
- An improved data stream summary: the count-min sketch and its applications
- Approximating matching size from random streams
- Approximating semi-matchings in streaming and in two-party communication
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Better bounds for matchings in the streaming model
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Combination Can Be Hard: Approximability of the Unique Coverage Problem
- Computing and Combinatorics
- Dynamic Graphs in the Sliding-Window Model
- Erratum to: The capacitated max k-cut problem
- Fractional set cover in the streaming model
- How hard is counting triangles in the streaming model?
- Improved approximation guarantees for weighted matching in the semi-streaming model
- Improved streaming algorithms for weighted matching, via unweighted matching
- Incidence geometries and the pass complexity of semi-streaming set cover
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
- Linear programming in the semi-streaming model with application to the maximum matching problem
- Maximum matching in semi-streaming with few passes
- Maximum matching in turnstile streams
- Minimum Membership Set Covering and the Consecutive Ones Property
- On graph problems in a semi-streaming model
- Optimal streaming algorithms for submodular maximization with cardinality constraints
- Parameterized Streaming: Maximal Matching and Vertex Cover
- Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Planar matching in streams revisited
- Semi-streaming set cover
- Streaming Lower Bounds for Approximating MAX-CUT
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- Streaming algorithms for submodular function maximization
- Sublinear estimation of weighted matchings in dynamic data streams
- Submodular maximization meets streaming: matchings, matroids, and more
- The one-way communication complexity of submodular maximization with applications to streaming and robustness
- The parameterized complexity of unique coverage and its variants
- Tight bounds for single-pass streaming complexity of the set cover problem
- Towards a theory of parameterized streaming algorithms
- Weighted matching in the semi-streaming model
- (1 + (1))-approximation to MAX-CUT requires linear space
This page was built for publication: Maximum coverage in the data stream model: parameterized and generalized
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229585)
