Image de couverture de livre

Review of Three Algorithms That Build k-d Trees

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

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

A Dynamic, Self-balancing k-d Tree
par: Brown, Russell A.
Publié: (2025)

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

Faster Combinatorial k-Clique Algorithms
par: Abboud, Amir, et autres
Publié: (2024)

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

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

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

Weighted $k$-Server Admits an Exponentially Competitive Algorithm
par: Bijoy, Adithya, et autres
Publié: (2025)

Semi-Streaming Algorithms for Weighted $k$-Disjoint Matchings
par: Ferdous, S M, et autres
Publié: (2023)

Improved Approximation Algorithms for Three-Dimensional Knapsack
par: Jansen, Klaus, et autres
Publié: (2025)

Faster Algorithms for $(2k-1)$-Stretch Distance Oracles
par: Kadria, Avi, et autres
Publié: (2025)

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

Faster Approximation Algorithms for k-Center via Data Reduction
par: Filtser, Arnold, et autres
Publié: (2025)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
par: Dai, Han, et autres
Publié: (2025)

Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts
par: Fischer, Nick, et autres
Publié: (2026)

FORWARD: Feasibility Oriented Random-Walk Inspired Algorithm for Radial Reconfiguration in Distribution Networks
par: Vendrell, Joan, et autres
Publié: (2024)

On Wagner's k-Tree Algorithm Over Integers
par: Lin, Haoxing, et autres
Publié: (2024)

Effective Index Construction Algorithm for Optimal $(k,η)$-cores Computation
par: Sun, Shengli, et autres
Publié: (2025)

Three Algorithms for Merging Hierarchical Navigable Small World Graphs
par: Ponomarenko, Alexander
Publié: (2025)

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
par: la Tour, Max Dupré, 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)

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

Fairness in Monotone $k$-submodular Maximization: Algorithms and Applications
par: Zhu, Yanhui, et autres
Publié: (2024)

KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
par: Jin, Mingming, et autres
Publié: (2023)

A $O^*((2 + ε)^k)$ Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs
par: Lafond, Manuel, et autres
Publié: (2026)

Tree Proof-of-Position Algorithms
par: Kharman, Aida Manzano, et autres
Publié: (2024)

A Faster $k$-means++ Algorithm
par: Liang, Jiehao, et autres
Publié: (2022)

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

Parameterized Algorithms for Computing MAD Trees
par: Breitkopf, Tom-Lukas, et autres
Publié: (2026)

qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
par: Dhar, Saurav, et autres
Publié: (2024)

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

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
par: Tate, Elise, et autres
Publié: (2025)

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs
par: Alejandro-Soto, J. A., 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)