:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Filtser, Arnold, Jiang, Shaofeng H. -C., Li, Yi, Naredla, Anurag Murty, Psarros, Ioannis, Yang, Qiaoyuan, Zhang, Qin
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2502.05888
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Art of Being Difficult: Combining Human and AI Strengths to Find Adversarial Instances for Heuristics
par: Nikoleit, Henri, et autres
Publié: (2026)

Fully Dynamic Algorithms for Chamfer Distance
par: Goranci, Gramoz, et autres
Publié: (2025)

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

Stochastic Embedding of Digraphs into DAGs
par: Filtser, Arnold
Publié: (2025)

Scattering and Sparse Partitions, and their Applications
par: Filtser, Arnold
Publié: (2020)

Hop-Constrained Metric Embeddings and their Applications
par: Filtser, Arnold
Publié: (2021)

A face cover perspective to $\ell_1$ embeddings of planar graphs
par: Filtser, Arnold
Publié: (2019)

On Strong Diameter Padded Decompositions
par: Filtser, Arnold
Publié: (2019)

A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fréchet distance
par: Driemel, Anne, et autres
Publié: (2025)

FPT approximations for Capacitated Sum of Radii and Diameters
par: Filtser, Arnold, et autres
Publié: (2024)

How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs
par: Conroy, Jonathan, et autres
Publié: (2025)

On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications
par: Filtser, Arnold
Publié: (2024)

Near Linear Time Approximation Schemes for Clustering of Partially Doubling Metrics
par: Driemel, Anne, et autres
Publié: (2026)

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

Highway Dimension: a Metric View
par: Feldmann, Andreas Emil, et autres
Publié: (2024)

Fully Scalable MPC Algorithms for Euclidean k-Center
par: Czumaj, Artur, et autres
Publié: (2025)

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

Dimension Reduction for Clustering: The Curious Case of Discrete Centers
par: Jiang, Shaofeng H. -C., et autres
Publié: (2025)

Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes
par: Filtser, Arnold, et autres
Publié: (2026)

Visibility Queries in Simple Polygons
par: Bhore, Sujoy, et autres
Publié: (2026)

Dynamic Light Spanners in Doubling Metrics
par: Bhore, Sujoy, et autres
Publié: (2026)

Faster Combinatorial k-Clique Algorithms
par: Abboud, Amir, et autres
Publié: (2024)

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
par: Bhore, Sujoy, et autres
Publié: (2023)

A Query-Driven Approach to Space-Efficient Range Searching
par: Fotakis, Dimitris, et autres
Publié: (2025)

Faster Algorithms for Schatten-p Low Rank Approximation
par: Kacham, Praneeth, et autres
Publié: (2024)

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

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

Faster Approximation Scheme for Euclidean $k$-TSP
par: van Wijland, Ernest, et autres
Publié: (2023)

Faster Algorithms for $(2k-1)$-Stretch Distance Oracles
par: Kadria, Avi, et autres
Publié: (2025)

A Faster $k$-means++ Algorithm
par: Liang, Jiehao, et autres
Publié: (2022)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
par: Łącki, Jakub, et autres
Publié: (2025)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
par: Ashvinkumar, Vikrant, et autres
Publié: (2024)

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

Fully Dynamic Euclidean k-Means
par: Bhattacharya, Sayan, et autres
Publié: (2025)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
par: Luo, Chunyu, et autres
Publié: (2024)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
par: la Tour, Max Dupré, et autres
Publié: (2024)

A Faster Deterministic Approximation Algorithm for TTP-2
par: Kanaya, Yuga, et autres
Publié: (2023)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
par: Ebbens, Matthijs, et autres
Publié: (2024)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
par: Esmer, Barış Can, et autres
Publié: (2024)

Faster Algorithm for Structured John Ellipsoid Computation
par: Cao, Yang, et autres
Publié: (2022)