Image de couverture de livre

A Dynamic, Self-balancing k-d Tree

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Brown, Russell A.
Format:	Preprint
Publié:	2025
Sujets:	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

Review of Three Algorithms That Build k-d Trees
par: Brown, Russell A.
Publié: (2025)

Building a Balanced k-d Tree in O(kn log n) Time
par: Brown, Russell A.
Publié: (2014)

Comparative Performance of the AVL Tree and Three Variants of the Red-Black Tree
par: Brown, Russell A.
Publié: (2024)

Fully Dynamic Euclidean k-Means
par: Bhattacharya, Sayan, et autres
Publié: (2025)

Dynamic k-center clustering with lifetimes
par: Moretti, Simone, et autres
Publié: (2026)

Minmax-Regret $k$-Sink Location on a Dynamic Tree Network with Uniform Capacities
par: Golin, Mordecai J., et autres
Publié: (2018)

On $b$-Matching and Fully-Dynamic Maximum $k$-Edge Coloring
par: El-Hayek, Antoine, et autres
Publié: (2023)

Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
par: Bhattacharya, Sayan, et autres
Publié: (2024)

Weighted $k$-Path and Other Problems in Almost $O^*(2^k)$ Deterministic Time via Dynamic Representative Sets
par: Nederlof, Jesper
Publié: (2025)

Chorba: A novel CRC32 implementation
par: Russell, Sam
Publié: (2024)

Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse
par: Bhattacharya, Sayan, et autres
Publié: (2024)

Fully Dynamic k-Means Coreset in Near-Optimal Update Time
par: la Tour, Max Dupré, et autres
Publié: (2024)

Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
par: Bhattacharya, Sayan, et autres
Publié: (2024)

On $k$-connectivity oracles in $k$-connected graphs
par: Nutov, Zeev
Publié: (2026)

Time Efficient Implementation for Online $k$-server Problem on Trees
par: Khadiev, Kamil, et autres
Publié: (2024)

Adaptive Fully Dynamic $k$-Center Clustering with (Near-)Optimal Worst-Case Guarantees
par: Grilnberger, Mara, et autres
Publié: (2026)

Maintaining $k$-MinHash Signatures over Fully-Dynamic Data Streams with Recovery
par: Clementi, Andrea, et autres
Publié: (2024)

KeBaB: $k$-mer based breaking for finding long MEMs
par: Brown, Nathaniel K., et autres
Publié: (2025)

Optimal-Length Labeling Schemes and Fast Algorithms for k-gathering and k-broadcasting
par: Ganczorz, Adam, et autres
Publié: (2025)

Time-Optimal $k$-Server
par: Frei, Fabian, et autres
Publié: (2025)

Computing k-mers in Graphs
par: Alanko, Jarno N., et autres
Publié: (2025)

Structural Parameterizations of $k$-Planarity
par: Gima, Tatsuya, et autres
Publié: (2025)

Parameterized algorithms for $k$-Inversion
par: Antony, Dhanyamol, et autres
Publié: (2026)

On Parallel $k$-Center Clustering
par: Coy, Sam, et autres
Publié: (2023)

On Constrained and k Shortest Paths
par: Bendahi, Abderrahim, et autres
Publié: (2024)

Colorful Priority $k$-Supplier
par: Chekuri, Chandra, et autres
Publié: (2024)

Toward Optimal Approximations for Resource-Minimization for Fire Containment on Trees and Non-Uniform k-Center
par: Blauth, Jannis, et autres
Publié: (2025)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
par: Korhonen, Tuukka
Publié: (2024)

A k-swap Local Search for Makespan Scheduling
par: Rohwedder, Lars, et autres
Publié: (2024)

An $2\sqrt{k}$-approximation algorithm for minimum power $k$ edge disjoint $st$ -paths
par: Nutov, Zeev
Publié: (2022)

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
par: Georgiadis, Loukas, et autres
Publié: (2026)

Dynamic Grammar-Compressed Self-Index in $δ$-Optimal Space
par: Nishimoto, Takaaki, et autres
Publié: (2026)

Performance bounds for nearest neighbor search with k-d trees
par: Bazzani, Marco, et autres
Publié: (2026)

A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Maximum Coverage $k$-Antichains and Chains: A Greedy Approach
par: Cáceres, Manuel, et autres
Publié: (2025)

A Simple PTAS for Weighted $k$-means and Sensor Coverage
par: Pareek, Akash, et autres
Publié: (2025)

Bicriteria approximation for $k$-edge-connectivity
par: Nutov, Zeev, et autres
Publié: (2025)

Optimal $k$-Secretary with Logarithmic Memory
par: Qiao, Mingda, et autres
Publié: (2025)

The $k$-Fold Matroid Secretary Problem
par: Gujjar, Rishi, et autres
Publié: (2025)

Randomized $k$-server in polynomial time
par: Coester, Christian, et autres
Publié: (2026)