Cover Image

Stable coresets: Unleashing the power of uniform sampling

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Carmel, Amir, Krauthgamer, Robert
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

Fitting Tree Metrics and Ultrametrics in Data Streams
by: Carmel, Amir, et al.
Published: (2025)

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

Dimension Reduction for Clustering: The Curious Case of Discrete Centers
by: Jiang, Shaofeng H. -C., et al.
Published: (2025)

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

On Sketching Quadratic Forms
by: Andoni, Alexandr, et al.
Published: (2015)

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

An Algorithmic Bridge Between Hamming and Levenshtein Distances
by: Goldenberg, Elazar, et al.
Published: (2022)

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

Local Gibbs sampling beyond local uniformity
by: Liu, Hongyang, et al.
Published: (2025)

Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters
by: Zhao, Zhuowei, et al.
Published: (2024)

A Scalable and Unified Framework to Weighted Rank Aggregation
by: Carmel, Amir, et al.
Published: (2026)

Optimally detecting uniformly-distributed $\ell_2$ heavy hitters in data streams
by: Velusamy, Santhoshini, et al.
Published: (2025)

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

On the power of standard DFS and BFS
by: Bui-Xuan, Binh-Minh, et al.
Published: (2026)

On Beating $2^n$ for the Closest Vector Problem
by: Abboud, Amir, et al.
Published: (2025)

Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs
by: Amir, Amihood, et al.
Published: (2024)

Worst-Case to Expander-Case Reductions: Derandomized and Generalized
by: Abboud, Amir, et al.
Published: (2024)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024)

Location-Restricted Stable Matching
by: Castro, Garret
Published: (2025)

On polynomial kernelization for Stable Cutset
by: Kratsch, Stefan, et al.
Published: (2024)

Single-Pass Streaming CSPs via Two-Tier Sampling
by: Azarmehr, Amir, et al.
Published: (2026)

Faster Combinatorial k-Clique Algorithms
by: Abboud, Amir, et al.
Published: (2024)

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
by: Azarmehr, Amir, et al.
Published: (2024)

Course Allocation with Credits via Stable Matching
by: Rodríguez, José, et al.
Published: (2025)

Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance
by: Azarmehr, Amir, et al.
Published: (2025)

Half-Approximating Maximum Dicut in the Streaming Setting
by: Azarmehr, Amir, et al.
Published: (2025)

Lower Bounds for Non-adaptive Local Computation Algorithms
by: Azarmehr, Amir, et al.
Published: (2025)

Stochastic Matching via In-n-Out Local Computation Algorithms
by: Azarmehr, Amir, et al.
Published: (2024)

On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and $k$-Mismatches
by: Amir, Amihood, et al.
Published: (2026)