Imagen de Portada

Sublinear Algorithms for Estimating Single-Linkage Clustering Costs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Peng, Pan, Sohler, Christian, Xu, Yi
Formato:	Preprint
Publicado:	2025
Materias:	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

Sublinear Spectral Clustering Oracle with Little Memory
por: Shen, Ranran, et al.
Publicado: (2026)

Simple and Optimal Sublinear Algorithms for Mean Estimation
por: Bertolotti, Beatrice, et al.
Publicado: (2024)

Property Testing of Computational Networks
por: Czumaj, Artur, et al.
Publicado: (2025)

Near Linear Time Approximation Schemes for Clustering of Partially Doubling Metrics
por: Driemel, Anne, et al.
Publicado: (2026)

Testing Depth First Search Numbering
por: Czumaj, Artur, et al.
Publicado: (2025)

On the adversarial robustness of Locality-Sensitive Hashing in Hamming space
por: Kapralov, Michael, et al.
Publicado: (2024)

Solving the Correlation Cluster LP in Sublinear Time
por: Cao, Nairen, et al.
Publicado: (2025)

Sublinear Algorithms for TSP via Path Covers
por: Behnezhad, Soheil, et al.
Publicado: (2023)

Efficient Centroid-Linkage Clustering
por: Bateni, MohammadHossein, et al.
Publicado: (2024)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
por: De Man, Quinten, et al.
Publicado: (2025)

Improved Sublinear Algorithms for Classical and Quantum Graph Coloring
por: Ferber, Asaf, et al.
Publicado: (2025)

A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fréchet distance
por: Driemel, Anne, et al.
Publicado: (2025)

Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
por: Dhulipala, Laxman, et al.
Publicado: (2024)

Approximating Dasgupta Cost in Sublinear Time from a Few Random Seeds
por: Kapralov, Michael, et al.
Publicado: (2022)

Improved Sublinear-time Moment Estimation using Weighted Sampling
por: Bhattacharya, Anup, et al.
Publicado: (2025)

A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time
por: Shen, Ranran, et al.
Publicado: (2023)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
por: Ebbens, Matthijs, et al.
Publicado: (2024)

Estimating Correlation Clustering Cost in Node-Arrival Stream
por: Liu, Kaiwen, et al.
Publicado: (2026)

Sublinear Time Algorithm for Online Weighted Bipartite Matching
por: Hu, Hang, et al.
Publicado: (2022)

Dynamic Correlation Clustering in Sublinear Update Time
por: Cohen-Addad, Vincent, et al.
Publicado: (2024)

Simple Sublinear Algorithms for $(Δ+1)$ Vertex Coloring via Asymmetric Palette Sparsification
por: Assadi, Sepehr, et al.
Publicado: (2025)

Fully Dynamic Exact Edge Connectivity in Sublinear Time
por: Goranci, Gramoz, et al.
Publicado: (2023)

Computing String Covers in Sublinear Time
por: Radoszewski, Jakub, et al.
Publicado: (2024)

On Solving Linear Systems in Sublinear Time
por: Andoni, Alexandr, et al.
Publicado: (2018)

Almost-Optimal Sublinear Additive Spanners
por: Tan, Zihan, et al.
Publicado: (2023)

Breaking Barriers: Combinatorial Algorithms for Non-monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
por: Chen, Yixin, et al.
Publicado: (2025)

Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model
por: Feng, Weiming, et al.
Publicado: (2025)

Sublinear Space Graph Algorithms in the Continual Release Model
por: Epasto, Alessandro, et al.
Publicado: (2024)

Sublinear Edge Fault Tolerant Spanners for Hypergraphs
por: He, Jialin, et al.
Publicado: (2025)

Counting Distinct Square Substrings in Sublinear Time
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2025)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
por: Bernstein, Aaron, et al.
Publicado: (2025)

Constant Approximation of Arboricity in Near-Optimal Sublinear Time
por: Dai, Jiangqi, et al.
Publicado: (2025)

Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time
por: Eden, Talya, et al.
Publicado: (2025)

Sublinear Random Access Generators for Preferential Attachment Graphs
por: Even, Guy, et al.
Publicado: (2016)

Lempel-Ziv (LZ77) Factorization in Sublinear Time
por: Kempa, Dominik, et al.
Publicado: (2024)

Learning-Augmented Streaming Algorithms for Correlation Clustering
por: Dong, Yinhao, et al.
Publicado: (2025)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
por: Dai, Han, et al.
Publicado: (2025)

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

Sublinear Metric Steiner Forest via Maximal Independent Set
por: Mahabadi, Sepideh, et al.
Publicado: (2025)

On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time
por: Kwok, Tsz Chiu, et al.
Publicado: (2025)