Imagen de Portada

Dynamic and Streaming Algorithms for Union Volume Estimation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bhore, Sujoy, Bringmann, Karl, Chan, Timothy M., Wang, Yanheng
Formato:	Preprint
Publicado:	2026
Materias:	Computational Geometry Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
por: Bhore, Sujoy, et al.
Publicado: (2024)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
por: Bringmann, Karl, et al.
Publicado: (2024)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
por: Bhore, Sujoy, et al.
Publicado: (2026)

Dynamic Light Spanners in Doubling Metrics
por: Bhore, Sujoy, et al.
Publicado: (2026)

Light Spanners with Small Hop-Diameter
por: Bhore, Sujoy, et al.
Publicado: (2025)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
por: Bhore, Sujoy, et al.
Publicado: (2025)

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
por: Bhore, Sujoy, et al.
Publicado: (2023)

Polyline Simplification has Cubic Complexity
por: Bringmann, Karl, et al.
Publicado: (2018)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
por: Bhore, Sujoy, et al.
Publicado: (2024)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
por: Chan, Timothy M., et al.
Publicado: (2025)

Visibility Queries in Simple Polygons
por: Bhore, Sujoy, et al.
Publicado: (2026)

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
por: Bringmann, Karl, et al.
Publicado: (2026)

Deterministic Volume Estimation of Truncated Hypercubes
por: Gunluk, Kyra
Publicado: (2026)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
por: Chan, Timothy M., et al.
Publicado: (2025)

Touring a Sequence of Orthogonal Polygons
por: Casel, Katrin, et al.
Publicado: (2026)

Delaunay Triangulations with Predictions
por: Cabello, Sergio, et al.
Publicado: (2026)

Enclosing Points with Geometric Objects
por: Chan, Timothy M., et al.
Publicado: (2024)

A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
por: Danait, Ved, et al.
Publicado: (2025)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
por: Bhore, Sujoy, et al.
Publicado: (2025)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
por: Banik, Aritra, et al.
Publicado: (2025)

Online TCP Acknowledgment under General Delays
por: Bhore, Sujoy, et al.
Publicado: (2026)

Fine-Grained Complexity of Continuous Euclidean k-Center
por: Blank, Lotte, et al.
Publicado: (2026)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
por: Chan, Timothy M., et al.
Publicado: (2026)

Algorithms for Computing Closest Points for Segments
por: Wang, Haitao
Publicado: (2024)

Algorithms for Halfplane Coverage and Related Problems
por: Wang, Haitao, et al.
Publicado: (2024)

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
por: Bringmann, Karl, et al.
Publicado: (2022)

An Optimal Algorithm for Half-plane Hitting Set
por: Liu, Gang, et al.
Publicado: (2025)

Improved Algorithms for Distance Selection and Related Problems
por: Wang, Haitao, et al.
Publicado: (2023)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2024)

Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
por: Bhore, Sujoy, et al.
Publicado: (2026)

Knapsack with Small Items in Near-Quadratic Time
por: Bringmann, Karl
Publicado: (2023)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
por: Banik, Aritra, et al.
Publicado: (2024)

Dynamic Unit-Disk Range Reporting
por: Wang, Haitao, et al.
Publicado: (2024)

Online Algorithms for Geometric Independent Set
por: De, Minati, et al.
Publicado: (2026)

Approximation Algorithms for Smallest Intersecting Balls
por: Zheng, Jiaqi, et al.
Publicado: (2024)

Even Faster Algorithm for the Chamfer Distance
por: Feng, Ying, et al.
Publicado: (2025)

Fast Algorithms for Minimum Homology Basis
por: Dhar, Amritendu, et al.
Publicado: (2021)

Beating Bellman's Algorithm for Subset Sum
por: Bringmann, Karl, et al.
Publicado: (2024)