Streaming algorithms for geometric Steiner forest
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5764809 (Why is no real title available?)
- scientific article; zbMATH DE number 3912403 (Why is no real title available?)
- scientific article; zbMATH DE number 51427 (Why is no real title available?)
- scientific article; zbMATH DE number 1775394 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- scientific article; zbMATH DE number 7053290 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- A PTAS for the Steiner forest problem in doubling metrics
- A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A local-search algorithm for Steiner forest
- Algorithms for dynamic geometric problems over data streams
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
- BALANCED PARTITION OF MINIMUM SPANNING TREES
- Combinatorial Algorithms for Compressed Sensing
- Communication Complexity
- Computing diameter in the streaming and sliding-window models
- Coresets in dynamic geometric data streams
- Dynamic streaming algorithms for -kernels
- Edit distance: sketching, streaming, and document exchange
- Efficient Sketches for Earth-Mover Distance, with Applications
- Estimating the sortedness of a data stream
- Euclidean prize-collecting Steiner forest
- Facility Location in Dynamic Geometric Data Streams
- Fast moment estimation in data streams in optimal space
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Geometric approximation algorithms
- Greedy algorithms for Steiner forest
- Greedy splitting algorithms for approximating multiway partition problems
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- High-dimensional geometric streaming in polynomial space
- New streaming algorithms for high dimensional EMD and MST
- On coresets for k-means and k-median clustering
- On randomized one-round communication complexity
- On the monotonicity of a data stream
- Parallel algorithms for geometric graph problems
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
- Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance
- Steiner Minimal Trees
- Streaming Embeddings with Slack
- Streaming Euclidean MST to a constant factor
- Streaming Euclidean \textsc{Max-Cut}: dimension vs data reduction
- Streaming algorithms for embedding and computing edit distance in the low distance regime
- Streaming algorithms for extent problems in high dimensions
- The communication and streaming complexity of computing the longest common and increasing subsequences
- The one-way communication complexity of Hamming distance
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- (1 + )-approximation for facility location in data streams
This page was built for publication: Streaming algorithms for geometric Steiner forest
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023545)
