Searcharxiv⌕ Search

arXiv · 2611.20359

Minimum Sum-of-Radii Clustering with Strong and Weak Oracles

Abstract

In the minimum sum of radii (MSR) problem, the input is a set of $n$ points in a metric space and a parameter $k$, and the goal is to cover the points by at most $k$ balls, each centered at an input point, while minimizing the sum of their radii. We study MSR in the weak-strong oracle model of Bateni, Dharangutte, Jayaram, and Wang (COLT'24), where the metric is unknown and is accessed through two oracles. The answers of the weak oracle are given to us for free: for every pair of points, we receive a distance value that, with probability $δ$, is arbitrarily corrupted. Exact distances are available only through costly strong queries, where a strong query on a point reveals its exact distances to all previously strongly queried points, and the goal is to minimize the number of strong queries. For every constant $δ< 1/2$, we give the first polynomial-time algorithm that makes $O(k \log n \log\log n)$ strong point queries and, with high probability, returns an $O(1)$-approximation for MSR; the previously best algorithm required running time and a number of strong queries exponential in $k$. This is within an $O(\log\log n)$ factor of a lower bound that we prove: any constant-factor approximation that succeeds with high probability on every instance must make $Ω(k \log n)$ strong queries in expectation on some instance. The same $Ω(k \log n)$ lower bound holds for $k$-center, where it matches the known upper bound up to an $O(\log\log n)$ factor. An optimal MSR cluster can be small both in size and in radius, so a uniform sample of strongly queried points may miss it entirely. Instead, our algorithm uses a packing LP over the balls certified so far to decide which points to query next. The analysis holds against an adversary who knows which pairs are corrupted.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zachary Friggstad, Mahya Jamshidian, Ali Vakilian. 2026-11-16. Minimum Sum-of-Radii Clustering with Strong and Weak Oracles. https://searcharxiv.com/abs/2611.20359

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation

In a typical online resource allocation problem, we start with a fixed inventory of resources and make online allocation decisions in response to resource requests that arrive sequentially over a finite horizon. We consider settings where the inventory is replenished over time according to an unknown exogenous process. We introduce black-box methods that extend any existing algorithm, originally designed without considering replenishment, into one that works with an arbitrary (adversarial or stochastic) replenishment process. Our approach preserves the original algorithm's competitive ratio in regimes with large initial inventory, thereby enabling the seamless integration of exogenous replenishment into a large body of existing algorithmic results for both adversarial and stochastic arrival models.

cs.DS↗

PHastR: Faster Minimal Perfect Hashing with Rotated Layouts

We present PHastR, a minimal perfect hash function of the PHast family. Like PHast+, the fast-to-build variant of PHast, PHastR finds feasible seeds with bit-parallel operations: its seeds move keys along rings of slots, and to evaluate the seeds of a bucket it cyclically shifts, for each key, a word recording which slots of its ring are used. Unlike PHast+, however, it is almost immune to self-collisions, which make two keys of a bucket collide for (almost) all its seeds: more than a third of the buckets bumped by PHast+ with wrapping and multiplier 3 contain one. With 8-bit seeds, PHastR uses $1.94$ bits per key, essentially the same space as the best variant of PHast+ with wrapping, but it is built in $37\%$ of the time, and its queries are $34\%$ faster on $10^9$ keys, as it bumps $0.5\%$ of the keys instead of $3.9\%$; they are faster also than those of PHast, which takes almost thirteen times as long to build, and than those of PtrHash, which uses more than one bit per key more. With a larger expected bucket size PHastR comes within $0.02$ bits per key of the space of PHast, using $1.90$ bits per key, and its queries are still about as fast. Its construction also scales better with the number of threads: with all the threads of a 96-core machine it is more than two and a half times faster than that of PHast+. An offline construction built PHastR on a trillion keys in $9.3$ hours on a single machine. Finally, we argue that when each key can be placed only within a range of $W$ slots, every placement of $n$ random keys on $n$ slots, however found, must bump on large key sets a constant fraction of the keys: we derive an asymptotic lower bound of about $0.1/W$ on the expected value of this fraction, and we prove that, in a Poisson model, the best placement bumps about $1/2W$ of the keys, which is about one tenth of the keys bumped by PHastR.

cs.DS↗

Single-Vertex Metropolis on Minor-Free Graphs: A General EPTAS

We consider a class of combinatorial optimization problems where the goal is to find a largest induced subgraph with a prescribed property. We assume that the property is preserved by taking induced subgraphs and disjoint unions, holds for all edgeless graphs, and can be tested in polynomial time. We study the single-vertex Metropolis process for this class of problems. We show that on graphs excluding an arbitrary fixed minor $H$, this process is a randomized efficient polynomial-time approximation scheme. Starting from any feasible solution on a graph with $n$ vertices, it finds a $(1-\varepsilon)$-approximation within $\exp(O_H(\varepsilon^{-2})) n(n+\log(1/δ))$ steps with probability at least $1-δ$. This includes maximum independent set, maximum induced forest, maximum induced bipartite subgraph, and maximum induced subgraph of degree at most one. The proof uses improving exchanges on one fixed division of the input graph into regions. A recursive separator construction performs each exchange inside a region of size $r$ in at most $2r$ moves, with temporary loss $O_H(\sqrt r)$. We count move sequences through each transition and bound the probability of avoiding all near-optimal states. The general theorem bounds the number of Metropolis steps in terms of the temporary loss along improvement paths. We extend the result to bounded weight imbalance and give a weighted-star obstruction for unrestricted weights.

cs.DS↗