Dynamic streaming algorithms for geometric independent set
From MaRDI portal
Cites work
- (1 + )-approximation for facility location in data streams
- A 3-approximation algorithm for maximum independent set of rectangles
- A note on maximum independent sets in rectangle intersection graphs
- A polynomial-time \(\mathrm{OPT}^\varepsilon\)-approximation algorithm for maximum independent set of connected subgraphs in a planar graph
- Algorithms for dynamic geometric problems over data streams
- Approximate nearest neighbor queries revisited
- Approximating maximum independent set for rectangles in the plane
- Approximation algorithms for maximum independent set of pseudo-disks
- Approximation schemes for covering and packing problems in image processing and VLSI
- Approximation schemes for independent set and sparse subsets of polygons
- Computing the independence number of intersection graphs
- Coresets in dynamic geometric data streams
- Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles
- Dynamic data structures for fat objects and their applications
- Dynamic streaming algorithms for -kernels
- Fast stabbing of boxes in high dimensions
- Fully dynamic maximum independent sets of disks in polylogarithmic update time
- scientific article; zbMATH DE number 1303579 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Improved approximation algorithms for rectangle tiling and packing.
- Interval selection in the streaming model
- Label placement by maximum independent set in rectangles
- Maximum independent set of rectangles
- On approximating maximum independent set of rectangles
- On streaming algorithms for geometric independent set and clique
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Polynomial-time approximation schemes for packing and piercing fat objects
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
- Streaming algorithms for geometric Steiner forest
- Streaming Embeddings with Slack
- Streaming Euclidean \textsc{Max-Cut}: dimension vs data reduction
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
- Width of points in the streaming model
- Worst-Case Efficient Dynamic Geometric Independent Set
This page was built for publication: Dynamic streaming algorithms for geometric independent set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312565)
