Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
57 articles · 3 sources · 57 papers ·
Top topics: Algorithms · AI
arXiv:2609.18914v1 Announce Type: new Abstract: The Matrix Spencer conjecture asks whether any $n$ real symmetric matrices A_1,...,A_n \in \mathbb{R}^{m \times m} of operator norm at most one admit a signing…
arXiv:2609.17713v1 Announce Type: new Abstract: The $\textit{Colored Knapsack Problem}$ (ColKP) generalizes the classical Knapsack Problem by partitioning the items into color classes and requiring the selected items to…
arXiv:2609.18397v1 Announce Type: new Abstract: In this paper we study the genome rearrangements done by translocation events. Genome rearrangements were used to measure evolutionary distance between organisms since…
arXiv:2609.17932v1 Announce Type: new Abstract: The demand matching problem generalizes both the knapsack problem and the $b$-matching problem. In this problem, each edge of a graph has a demand and a weight, and each…
arXiv:2609.17655v1 Announce Type: new Abstract: In an important recent work, Blanc (2026) gave an algorithm for robustly learning Boolean concept classes with respect to a fixed distribution that outputs a (randomized)…
arXiv:2609.17650v1 Announce Type: new Abstract: The Binary Tree Mechanism is a standard algorithm for differentially private continual counting, but its asymptotic optimality under pure differential privacy has remained…
arXiv:2609.18309v1 Announce Type: cross Abstract: The round-robin procedure is a simple and well-studied fair division mechanism where agents pick goods in turns. Motivated by draft mechanisms in sports leagues, we…
arXiv:2609.18023v1 Announce Type: cross Abstract: Chatterjee and Sloman proved that a bounded measurable similarity function with sufficiently small average Gromov hyperbolicity admits a tree representation with small…
arXiv:2609.19089v1 Announce Type: new Abstract: We study the space complexity of diameter estimation for a set of points in Euclidean space in the dynamic (turnstile) streaming model. The seminal work of Indyk (SODA…
arXiv:2406.13668v4 Announce Type: replace-cross Abstract: A set of probabilistic forecasts is calibrated if each prediction of the forecaster closely approximates the empirical distribution of outcomes on the subset of…
arXiv:2609.17568v1 Announce Type: new Abstract: Additive-congestion constraints in single-source unsplittable flow can enforce stable-set structure. This note isolates and generalises that mechanism. We introduce a…
arXiv:2511.00470v3 Announce Type: replace Abstract: In this paper, we consider the minimum submodular cost allocation (MSCA) problem. The input of MSCA consists of $k$ nonnegative submodular functions…
arXiv:2609.18046v1 Announce Type: new Abstract: We study the problem of scheduling jobs on a serial-batch machine with the aim of minimising the total weighted late work. In a serial-batch setting, jobs within a batch…
arXiv:2609.19136v1 Announce Type: new Abstract: The paper presents a one-pass algorithm in the insert-delete graph stream model that returns a $(1+\varepsilon)(\alpha+2)$-approximation for the size of the maximum…
arXiv:2609.18913v1 Announce Type: new Abstract: \cite{mss2015} proved Weaver's discrepancy result existentially, resolving the Kadison--Singer conjecture . Finding such signs efficiently for general inputs remained an…
arXiv:2609.19001v1 Announce Type: new Abstract: We study deterministic online bipartite matching with local recourse. Online vertices arrive one by one and reveal edges to a fixed offline set. After each arrival, the…
arXiv:2609.19129v1 Announce Type: new Abstract: A \emph{directed feedback vertex set} of a digraph is a set of vertices whose removal destroys all directed cycles. The \textsc{Directed Feedback Vertex Set}…
arXiv:2609.18712v1 Announce Type: new Abstract: We give an approximately uniform sampler for satisfying assignments of constraint satisfaction problems that satisfy $4\mathrm e p(\Delta+1)^2\le1$, where $p$ is the…
arXiv:2609.18635v1 Announce Type: new Abstract: We study the canonical \textsf{Maximum Clique} and \textsf{Maximum Independent Set} problems in the one-pass edge-arrival graph streaming setting. Here, the edges of some…
arXiv:2609.17624v1 Announce Type: new Abstract: We study an $\varepsilon$-differentially private synthetic measure for $n$ points in $[0,1]^d$ by applying the existing PrivTree algorithm to construct an adaptive binary…
Showing 1 day · 57 items available
