Cover Image

Fast $k$-means Seeding Under The Manifold Hypothesis

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shah, Poojan, Agrawal, Shashwat, Jaiswal, Ragesh
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A New Rejection Sampling Approach to $k$-$\mathtt{means}$++ With Improved Trade-Offs
by: Shah, Poojan, et al.
Published: (2025)

Quantum (Inspired) $D^2$-sampling with Applications
by: Shah, Poojan, et al.
Published: (2024)

A Quantum Approximation Scheme for k-Means
by: Jaiswal, Ragesh
Published: (2023)

Clustering What Matters in Constrained Settings
by: Jaiswal, Ragesh, et al.
Published: (2023)

Improved Algorithms for Clustering with Noisy Distance Oracles
by: Pradhan, Pinki, et al.
Published: (2026)

Robust-Sorting and Applications to Ulam-Median
by: Jaiswal, Ragesh, et al.
Published: (2025)

FPT Approximation for Capacitated Sum of Radii
by: Jaiswal, Ragesh, et al.
Published: (2024)

Local Search k-means++ with Foresight
by: Conrads, Theo, et al.
Published: (2024)

Optimal-Length Labeling Schemes and Fast Algorithms for k-gathering and k-broadcasting
by: Ganczorz, Adam, et al.
Published: (2025)

A Simple PTAS for Weighted $k$-means and Sensor Coverage
by: Pareek, Akash, et al.
Published: (2025)

3SUM in Preprocessed Universes: Faster and Simpler
by: Kasliwal, Shashwat, et al.
Published: (2024)

Fast Iteration of Spaced k-mers
by: Czech, Lucas
Published: (2026)

Fast Computation of $k$-Runs, Parameterized Squares, and Other Generalised Squares
by: Nakashima, Yuto, et al.
Published: (2025)

Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse
by: Bhattacharya, Sayan, et al.
Published: (2024)

Concentration of Submodular Functions and Read-k Families Under Negative Dependence
by: Duppala, Sharmila, et al.
Published: (2023)

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
by: Assadi, Sepehr, et al.
Published: (2025)

A Faster $k$-means++ Algorithm
by: Liang, Jiehao, et al.
Published: (2022)

On $k$-connectivity oracles in $k$-connected graphs
by: Nutov, Zeev
Published: (2026)

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
by: Lehmann, Hans-Peter, et al.
Published: (2025)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
by: Nguyen, Hue T., et al.
Published: (2025)

Fast Broadcast in Highly Connected Networks
by: Chandra, Shashwat, et al.
Published: (2024)

Parameterized algorithms for $k$-Inversion
by: Antony, Dhanyamol, et al.
Published: (2026)

On Parallel $k$-Center Clustering
by: Coy, Sam, et al.
Published: (2023)

On Constrained and k Shortest Paths
by: Bendahi, Abderrahim, et al.
Published: (2024)

Time-Optimal $k$-Server
by: Frei, Fabian, et al.
Published: (2025)

Computing k-mers in Graphs
by: Alanko, Jarno N., et al.
Published: (2025)

Colorful Priority $k$-Supplier
by: Chekuri, Chandra, et al.
Published: (2024)

Structural Parameterizations of $k$-Planarity
by: Gima, Tatsuya, et al.
Published: (2025)

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries
by: Shah, Vihan
Published: (2026)

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
by: Georgiadis, Loukas, et al.
Published: (2026)

An $2\sqrt{k}$-approximation algorithm for minimum power $k$ edge disjoint $st$ -paths
by: Nutov, Zeev
Published: (2022)

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

Randomized $k$-server in polynomial time
by: Coester, Christian, et al.
Published: (2026)

Dynamic k-center clustering with lifetimes
by: Moretti, Simone, et al.
Published: (2026)

Bicriteria approximation for $k$-edge-connectivity
by: Nutov, Zeev, et al.
Published: (2025)

Fault-tolerant $k$-Supplier with Outliers
by: Chakrabarty, Deeparnab, et al.
Published: (2023)

Insights into $(k,ρ)$-shortcutting algorithms
by: Leonhardt, Alexander, et al.
Published: (2024)

Optimal $k$-Secretary with Logarithmic Memory
by: Qiao, Mingda, et al.
Published: (2025)

Fully Dynamic Euclidean k-Means
by: Bhattacharya, Sayan, et al.
Published: (2025)

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