Image de couverture de livre

Dimension Reduction for Clustering: The Curious Case of Discrete Centers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jiang, Shaofeng H. -C., Krauthgamer, Robert, Sapir, Shay, Silwal, Sandeep, Yue, Di
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

Moderate Dimension Reduction for $k$-Center Clustering
par: Jiang, Shaofeng H. -C., et autres
Publié: (2023)

Near-Optimal Dimension Reduction for Facility Location
par: Huang, Lingxiao, et autres
Publié: (2024)

Coresets for Kernel Clustering
par: Jiang, Shaofeng H. -C., et autres
Publié: (2021)

The Power of Recursive Embeddings for $\ell_p$ Metrics
par: Krauthgamer, Robert, et autres
Publié: (2025)

Fully Scalable MPC Algorithms for Clustering in High Dimension
par: Czumaj, Artur, et autres
Publié: (2023)

Coresets for Robust Clustering via Black-box Reductions to Vanilla Case
par: Jiang, Shaofeng H. -C., et autres
Publié: (2025)

Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
par: Gao, Jie, et autres
Publié: (2025)

Streaming Algorithms for Geometric Steiner Forest
par: Czumaj, Artur, et autres
Publié: (2020)

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
par: Silwal, Sandeep, et autres
Publié: (2025)

On the Adversarial Robustness of Online Importance Sampling
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

Connectivity Labeling in Faulty Colored Graphs
par: Petruschka, Asaf, et autres
Publié: (2024)

Optimal Algorithms for Augmented Testing of Discrete Distributions
par: Aliakbarpour, Maryam, et autres
Publié: (2024)

Stable coresets: Unleashing the power of uniform sampling
par: Carmel, Amir, et autres
Publié: (2025)

Sketching Cuts in Graphs and Hypergraphs
par: Kogan, Dmitry, et autres
Publié: (2014)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
par: Kenneth, Yotam, et autres
Publié: (2023)

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

Simple Algorithms for Fully Dynamic Edge Connectivity
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

Cut-Query Algorithms with Few Rounds
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

Robust Streaming Against Low-Memory Adversaries
par: Ben-Eliezer, Omri, et autres
Publié: (2025)

Parks and Recreation: Color Fault-Tolerant Spanners Made Local
par: Parter, Merav, et autres
Publié: (2024)

Local Search for Clustering in Almost-linear Time
par: Jiang, Shaofeng H. -C., et autres
Publié: (2025)

On Solving Linear Systems in Sublinear Time
par: Andoni, Alexandr, et autres
Publié: (2018)

Clustering Permutations: New Techniques with Streaming Applications
par: Chakraborty, Diptarka, et autres
Publié: (2022)

Tree Embedding in High Dimensions: Dynamic and Massively Parallel
par: Goranci, Gramoz, et autres
Publié: (2025)

Fair Clustering in the Sliding Window Model
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Skirting Additive Error Barriers for Private Turnstile Streams
par: Aamand, Anders, et autres
Publié: (2026)

The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends
par: Blank, Lotte, et autres
Publié: (2025)

Relative Error Fair Clustering in the Weak-Strong Oracle Model
par: Braverman, Vladimir, et autres
Publié: (2025)

Dynamic Set Cover with Worst-Case Recourse
par: Solomon, Shay, et autres
Publié: (2025)

Streaming Max-Cut in General Metrics
par: Jiang, Shaofeng H. -C., et autres
Publié: (2025)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
par: Krauthgamer, Robert, et autres
Publié: (2026)

How fast can you find a good hypothesis?
par: Aamand, Anders, et autres
Publié: (2025)

A Bi-metric Framework for Fast Similarity Search
par: Xu, Haike, et autres
Publié: (2024)

Round-efficient Fully-scalable MPC algorithms for k-Means
par: Jiang, Shaofeng H. -C., et autres
Publié: (2026)

Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
par: Aamand, Anders, et autres
Publié: (2025)

Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-offs and Algorithms
par: Roditty, Liam, et autres
Publié: (2025)

On Sketching Quadratic Forms
par: Andoni, Alexandr, et autres
Publié: (2015)

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