cs.DS · 2026-11-09 · No. 168

Data Structures and Algorithms, 2026-11-09.

3 new papers in cs.DS. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

3 entries
  1. 01

    Coresets for Capacitated Clustering via Dual Concentration

    Milind Prabhu, Chris Schwiegelshohn, Sudarshan Shyam, Erik Waingarten

    cs.DS · cs.CG · cs.LG

    We study coresets for clustering problems, focusing on the classical $k$-median and $k$-means objectives. A coreset is a small weighted summary of the input data that approximately preserves the clustering cost for every choice of centers. Such summaries are a central tool for scaling clustering algorithms to large datasets. In this work, we consider the capacitated setting, where the clustering is subject not only to choosing centers but...

    arxiv.org/abs/2611.09600 · PDF

  2. 02

    Load Balancing with Item Fragmentation and More Bins than Items: Linear-Time and Exact

    Ben Bals, Tomáš Flouri, Kassian Kobert, Solon P. Pissis, Leen Stougie

    cs.DS · cs.DC

    We study a fundamental load-balancing problem in which $N$ items of strictly positive integer sizes with total size $W$ must be assigned to $B$ bins, with items allowed to be divided into integer-size fragments across bins. Each bin must receive a load of either $\lfloor W/B \rfloor$ or $\lceil W/B \rceil$, ensuring that the loads of any two bins differ by at most one unit. Under this constraint, the objective is to minimize the maximum...

    arxiv.org/abs/2611.09267 · PDF

  3. 03

    PaB-tree: Parallel B+-tree with Batch Updates

    Ziyang Men, Yan Gu, Yihan Sun, Helen Xu

    cs.DS · cs.DB · cs.DC

    The B+-tree is a ubiquitous search index due to its provable I/O (cache) efficiency. Yet unlike batch-parallel binary search trees, which are both fast and widely available, no batch-parallel B+-tree offers strong empirical performance together with provable, near-optimal I/O efficiency. Prior B+-tree-based designs are either parallel but purely theoretical, with no high-performance implementation, or concurrent indexes such as the Bw-tree...

    arxiv.org/abs/2611.09172 · PDF

This edition is part of The Daily Abstract — cs.DS archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.