Imagen de Portada

Dimension Reduction for Clustering: The Curious Case of Discrete Centers

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jiang, Shaofeng H. -C., Krauthgamer, Robert, Sapir, Shay, Silwal, Sandeep, Yue, Di
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

Moderate Dimension Reduction for $k$-Center Clustering
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2023)

Near-Optimal Dimension Reduction for Facility Location
por: Huang, Lingxiao, et al.
Publicado: (2024)

Coresets for Kernel Clustering
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2021)

The Power of Recursive Embeddings for $\ell_p$ Metrics
por: Krauthgamer, Robert, et al.
Publicado: (2025)

Fully Scalable MPC Algorithms for Clustering in High Dimension
por: Czumaj, Artur, et al.
Publicado: (2023)

Coresets for Robust Clustering via Black-box Reductions to Vanilla Case
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)

Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
por: Gao, Jie, et al.
Publicado: (2025)

Streaming Algorithms for Geometric Steiner Forest
por: Czumaj, Artur, et al.
Publicado: (2020)

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
por: Silwal, Sandeep, et al.
Publicado: (2025)

On the Adversarial Robustness of Online Importance Sampling
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Connectivity Labeling in Faulty Colored Graphs
por: Petruschka, Asaf, et al.
Publicado: (2024)

Optimal Algorithms for Augmented Testing of Discrete Distributions
por: Aliakbarpour, Maryam, et al.
Publicado: (2024)

Stable coresets: Unleashing the power of uniform sampling
por: Carmel, Amir, et al.
Publicado: (2025)

Sketching Cuts in Graphs and Hypergraphs
por: Kogan, Dmitry, et al.
Publicado: (2014)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
por: Kenneth, Yotam, et al.
Publicado: (2023)

Faster Approximation Algorithms for k-Center via Data Reduction
por: Filtser, Arnold, et al.
Publicado: (2025)

Simple Algorithms for Fully Dynamic Edge Connectivity
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Cut-Query Algorithms with Few Rounds
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Robust Streaming Against Low-Memory Adversaries
por: Ben-Eliezer, Omri, et al.
Publicado: (2025)

Parks and Recreation: Color Fault-Tolerant Spanners Made Local
por: Parter, Merav, et al.
Publicado: (2024)

Local Search for Clustering in Almost-linear Time
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)

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

Clustering Permutations: New Techniques with Streaming Applications
por: Chakraborty, Diptarka, et al.
Publicado: (2022)

Tree Embedding in High Dimensions: Dynamic and Massively Parallel
por: Goranci, Gramoz, et al.
Publicado: (2025)

Fair Clustering in the Sliding Window Model
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Skirting Additive Error Barriers for Private Turnstile Streams
por: Aamand, Anders, et al.
Publicado: (2026)

The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends
por: Blank, Lotte, et al.
Publicado: (2025)

Relative Error Fair Clustering in the Weak-Strong Oracle Model
por: Braverman, Vladimir, et al.
Publicado: (2025)

Dynamic Set Cover with Worst-Case Recourse
por: Solomon, Shay, et al.
Publicado: (2025)

Streaming Max-Cut in General Metrics
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
por: Krauthgamer, Robert, et al.
Publicado: (2026)

How fast can you find a good hypothesis?
por: Aamand, Anders, et al.
Publicado: (2025)

A Bi-metric Framework for Fast Similarity Search
por: Xu, Haike, et al.
Publicado: (2024)

Round-efficient Fully-scalable MPC algorithms for k-Means
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2026)

Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
por: Aamand, Anders, et al.
Publicado: (2025)

Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-offs and Algorithms
por: Roditty, Liam, et al.
Publicado: (2025)

On Sketching Quadratic Forms
por: Andoni, Alexandr, et al.
Publicado: (2015)

Adaptive Fully Dynamic $k$-Center Clustering with (Near-)Optimal Worst-Case Guarantees
por: Grilnberger, Mara, et al.
Publicado: (2026)