Imagen de Portada

Robust-Sorting and Applications to Ulam-Median

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jaiswal, Ragesh, Kumar, Amit, Yadav, Jatin
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

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

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

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

A Quantum Approximation Scheme for k-Means
por: Jaiswal, Ragesh
Publicado: (2023)

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

Fast $k$-means Seeding Under The Manifold Hypothesis
por: Shah, Poojan, et al.
Publicado: (2026)

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

Hardness of Median and Center in the Ulam Metric
por: Fischer, Nick, et al.
Publicado: (2025)

Multi-Way Co-Ranking: Index-Space Partitioning of Sorted Sequences Without Merge
por: Joshi, Amit
Publicado: (2025)

zSort: Stable Distribution Sort using Z-Score Partitioning
por: Jain, Hriday, et al.
Publicado: (2026)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
por: Grandoni, Fabrizio, et al.
Publicado: (2026)

Hitting Axis-Parallel Segments with Weighted Points
por: Raman, Rajiv, et al.
Publicado: (2026)

On the LSH Distortion of Ulam and Cayley Similarities
por: Chierichetti, Flavio, et al.
Publicado: (2026)

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
por: Cohen-Addad, Vincent, et al.
Publicado: (2022)

QR Sort: A Novel Non-Comparative Sorting Algorithm
por: Bushman, Randolph T., et al.
Publicado: (2024)

Improved Online Sorting
por: Nirjhor, Jubayer, et al.
Publicado: (2025)

Facility Location and $k$-Median with Fair Outliers
por: Dabas, Rajni, et al.
Publicado: (2025)

Median and Small Parsimony Problems on RNA trees
por: Marchand, Bertrand, et al.
Publicado: (2024)

Separating $k$-Median from the Supplier Version
por: Anand, Aditya, et al.
Publicado: (2024)

How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms
por: Gila, Ofek, et al.
Publicado: (2026)

Sorting as Gradient Flow on the Permutohedron
por: Landers, Jonathan
Publicado: (2025)

Scalable Distributed String Sorting
por: Kurpicz, Florian, et al.
Publicado: (2024)

Deterministic $k$-Median Clustering in Near-Optimal Time
por: Costa, Martín, et al.
Publicado: (2025)

Connected k-Median with Disjoint and Non-disjoint Clusters
por: Eube, Jan, et al.
Publicado: (2025)

Compressing Hypergraphs using Suffix Sorting
por: Adler, Enno, et al.
Publicado: (2025)

Sorting and Selection in Rounds with Adversarial Comparisons
por: Trevisan, Chris
Publicado: (2023)

Anytime Sorting Algorithms (Extended Version)
por: Caizergues, Emma, et al.
Publicado: (2024)

A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

DialSort: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and Substrate-Aware Analysis
por: Narvaez, Alexander
Publicado: (2026)

Nearly Tight Bounds for the Online Sorting Problem
por: Azar, Yossi, et al.
Publicado: (2025)

Nearly Optimal Bounds for Stochastic Online Sorting
por: Hu, Yang
Publicado: (2025)

Sorting multibay block stacking storage systems
por: Pfrommer, Jakob, et al.
Publicado: (2024)

Sorted Range Reporting and Range Minima Queries
por: Akram, Waseem, et al.
Publicado: (2021)

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
por: Opler, Michal
Publicado: (2024)

Tight Bounds for Sorting Under Partial Information
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

An Optimal Sorting Algorithm for Persistent Random Comparison Faults
por: Geissmann, Barbara, et al.
Publicado: (2025)

SquareSort: a cache-oblivious sorting algorithm
por: Koucký, Michal, et al.
Publicado: (2024)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
por: Kalavas, Andreas, et al.
Publicado: (2025)

A Predictive Framework for Base-n Radix Sort Optimization
por: Pandey, Atharv, et al.
Publicado: (2025)