Image de couverture de livre

Tight Bounds on the Number of Closest Pairs in Vertical Slabs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Biniaz, Ahmad, Bose, Prosenjit, Chung, Chaeyoon, De Carufel, Jean-Lou, Iacono, John, Maheshwari, Anil, Odak, Saeed, Smid, Michiel, Tóth, Csaba D.
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Deciding if a DAG is Interesting is Hard
par: De Carufel, Jean-Lou, et autres
Publié: (2025)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
par: Biniaz, Ahmad, et autres
Publié: (2024)

Noncrossing Longest Paths and Cycles
par: Aloupis, Greg, et autres
Publié: (2024)

On Separating Path and Tree Systems in Graphs
par: Biniaz, Ahmad, et autres
Publié: (2023)

On 1-Planar Graphs with Bounded Cop-Number
par: Bose, Prosenjit, et autres
Publié: (2024)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
par: Chung, Chaeyoon, et autres
Publié: (2026)

Euclidean Maximum Matchings in the Plane---Local to Global
par: Biniaz, Ahmad, et autres
Publié: (2024)

Polychromatic Coloring of Tuples in Hypergraphs
par: Biniaz, Ahmad, et autres
Publié: (2025)

An Improved Bound for Plane Covering Paths
par: Akitaya, Hugo A., et autres
Publié: (2025)

Computing shortest paths amid non-overlapping weighted disks
par: Bose, Prosenjit, et autres
Publié: (2024)

Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
par: Bose, Prosenjit, et autres
Publié: (2025)

Contiguous Boundary Guarding
par: Biniaz, Ahmad, et autres
Publié: (2024)

Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems
par: Alman, Josh, et autres
Publié: (2024)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
par: Biedl, Therese, et autres
Publié: (2024)

Computing Oriented Spanners and their Dilation
par: Buchin, Kevin, et autres
Publié: (2024)

Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance
par: Azarmehr, Amir, et autres
Publié: (2025)

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair
par: Beretta, Lorenzo, et autres
Publié: (2025)

The Exact Spanning Ratio of the Parallelogram Delaunay Graph
par: Bose, Prosenjit, et autres
Publié: (2023)

Distance-Preserving Graph Compression Techniques
par: Madani, Amirali, et autres
Publié: (2023)

Tight Paths and Tight Pairs in Weighted Directed Graphs
par: Balcázar, José Luis
Publié: (2025)

Completely Independent Steiner Trees
par: Maheshwari, Anil, et autres
Publié: (2026)

Evaluating Diaphragm Force in Steel Dual Frames With Sliding Slab
par: Alvaro Córdova, et autres
Publié: (2026)

Tight Sampling Bounds for Eigenvalue Approximation
par: Swartworth, William, et autres
Publié: (2024)

Tight Bounds for Classical Open Addressing
par: Bender, Michael A., et autres
Publié: (2024)

On Beating $2^n$ for the Closest Vector Problem
par: Abboud, Amir, et autres
Publié: (2025)

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
par: Bhore, Sujoy, et autres
Publié: (2023)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
par: Madani, Amirali, et autres
Publié: (2025)

Almost Tight Bounds for Online Hypergraph Matching
par: Tröbst, Thorben, et autres
Publié: (2024)

Nearly Tight Bounds for the Online Sorting Problem
par: Azar, Yossi, et autres
Publié: (2025)

Tight Bounds for Sorting Under Partial Information
par: van der Hoog, Ivor, et autres
Publié: (2024)

Algorithms for Computing Closest Points for Segments
par: Wang, Haitao
Publié: (2024)

Simplified Tight Bounds for Monotone Minimal Perfect Hashing
par: Kosolobov, Dmitry
Publié: (2024)

Almost Tight Bounds for Differentially Private Densest Subgraph
par: Dinitz, Michael, et autres
Publié: (2023)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
par: Kuszmaul, William, et autres
Publié: (2024)

Triangle-Covered Graphs: Algorithms, Complexity, and Structure
par: Madani, Amirali, et autres
Publié: (2025)

Connected Dominating Sets in Triangulations
par: Bose, Prosenjit, et autres
Publié: (2023)

The Spanning Ratio of the Directed $Θ_6$-Graph is 5
par: Bose, Prosenjit, et autres
Publié: (2026)

Approximate Light Spanners in Planar Graphs
par: Le, Hung, et autres
Publié: (2025)

A Tight Lower Bound for Cycle Detection in Grid Graphs
par: Au, Andrew
Publié: (2026)

Tight Lower Bounds for Central String Queries in Compressed Space
par: Kempa, Dominik, et autres
Publié: (2025)