Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
33 articles · 3 sources · 33 papers ·
Top topics: Algorithms
arXiv:2510.03899v3 Announce Type: replace-cross Abstract: Balancing resource efficiency and fairness is critical in networked systems that support modern learning applications. We introduce the \emph{Fair Minimum…
arXiv:2606.14995v2 Announce Type: replace Abstract: The problems of designing sparse networks arise frequently in resource allocation and operations research. In production systems, for example, sparse process…
arXiv:2510.06316v3 Announce Type: replace-cross Abstract: The efficient implementation of matrix arithmetic operations underpins the speedups of many quantum algorithms. We develop a suite of methods to perform matrix…
arXiv:2609.01365v1 Announce Type: new Abstract: The shortest common superstring problem is to find the shortest string that contains every string in a given set as a substring. It is conjectured that the greedy…
arXiv:2603.26943v4 Announce Type: replace Abstract: In the Stable Roommates Problem (SR), a set of $2n$ agents rank one another in a linear order. The goal is to find a matching that is stable: one that has no pair of…
arXiv:2609.00045v1 Announce Type: new Abstract: Under individual smoothness, the optimal incremental first-order oracle (IFO) complexity of nonconvex finite-sum optimization has remained open. Known algorithms use…
arXiv:2509.25445v3 Announce Type: replace Abstract: The standard formalization of preprocessing in parameterized complexity is given by kernelization. In this work, we depart from this paradigm and study a different…
arXiv:2512.14390v2 Announce Type: replace Abstract: A $b$-coloring of a graph is a proper vertex coloring such that each color class contains a vertex that sees all other colors in its neighborhood. The $b$-coloring…
arXiv:2608.26952v2 Announce Type: replace Abstract: Recent work by Haeupler, Hlad\'ik, Rozhon, Tarjan, and T\v{e}tek on the instance optimality of shortest-path algorithms established several results concerning…
arXiv:2604.24132v2 Announce Type: replace Abstract: We initiate the study of the shortest reconfiguration problem for independent sets under the adjacency relation derived from the independent set polytope. Given a…
arXiv:2609.01283v1 Announce Type: new Abstract: Sensitivity oracles preprocess a graph so that queries can be answered after any $f$ edge insertions and deletions, without recomputing from scratch. For structural…
arXiv:2609.01021v1 Announce Type: new Abstract: The \emph{$s$-Club Cluster Edge Deletion} problem asks whether, given a graph $G$ and an integer $k$, one can delete at most $k$ edges so that every remaining connected…
arXiv:2608.28031v2 Announce Type: replace Abstract: The canonical Bethe approximation gives a deterministic approximation to the permanent of every nonnegative matrix within a factor of $(\sqrt{2})^n$. We improve the…
arXiv:2609.00710v1 Announce Type: new Abstract: An LLM application often sells or internally allocates several service products: a small or premium model, a short or long token cap, and possibly multiple posted prices.…
arXiv:2608.25032v2 Announce Type: replace Abstract: The problem of pattern matching, that is, finding all occurrences of a given pattern in a string, is one of the fundamental problems in computer science that has…
arXiv:2607.08997v2 Announce Type: replace Abstract: In this paper we develop the framework of using a parametrized mapping $[\sigma(1), \sigma(2), \cdots, \sigma(n)] \mapsto \sigma(1)z + \sigma(2)z^2 + \cdots…
arXiv:2609.00893v1 Announce Type: new Abstract: We study path diversification in trusted-node networks, where sensitive material is relayed through intermediate nodes, some of which may be compromised. Our randomized…
arXiv:2609.00678v1 Announce Type: cross Abstract: Daviaud, Guillon, and Merlet proved that comparison of max-plus automata is undecidable under a fixed state bound of 553 and explicitly left the range from 2 to 552…
arXiv:2608.27986v2 Announce Type: replace Abstract: Numerical integration---approximating the integral of a function $f$ using $n$ point evaluations---is a central task in science and engineering. The two main paradigms…
arXiv:2608.23500v4 Announce Type: replace-cross Abstract: Let $\lambda(n)=(-1)^{\Omega(n)}$ be the Liouville function. We prove a fixed power-logarithmic bound for its logarithmically weighted two-point correlations…
Showing 1 day · 33 items available
