Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
56 articles · 3 sources · 56 papers ·
Top topics: Algorithms · AI
arXiv:2609.27161v1 Announce Type: new Abstract: Resource allocation systems often restrict each request to a short list of options before coordinating assignments globally. We study this separation in stochastic…
arXiv:2609.27818v1 Announce Type: new Abstract: Interprocedural dominance asks which program points every matched call-and-return execution must pass on its way to a target. An analysis that writes out immediate…
arXiv:2609.27170v1 Announce Type: new Abstract: We study exact pattern matching on indeterminate strings, where a text or pattern position may represent a set of symbols rather than a single letter. Focusing on…
arXiv:2609.28292v1 Announce Type: cross Abstract: We report an explicit construction of a 27 x 27 x 27 symmetric tensor with rational entries that has tensor rank 55 over the rational numbers and symmetric tensor rank…
arXiv:2609.27117v1 Announce Type: new Abstract: The Minimum Sum Vertex Cover (MSVC) problem asks for an ordering of the vertices of a graph that minimizes the sum, over all edges, of the time at which each edge is first…
arXiv:2609.27719v1 Announce Type: new Abstract: An edge weighting of a graph induces a coloring of its vertices in which the color of a vertex is the total weight of the edges incident with it. Such an edge weighting is…
arXiv:2602.13155v3 Announce Type: replace-cross Abstract: Neural networks, particularly message-passing neural networks (MPNNs), are increasingly used as heuristics for hard combinatorial optimization problems. Yet many…
arXiv:2609.26873v1 Announce Type: cross Abstract: We study gradient descent with predetermined nonnegative stepsizes on smooth strongly convex functions. Let $p_{\mathrm{sil}}=\log_2(1+\sqrt2)$ and $\kappa$ be the…
arXiv:2609.27231v1 Announce Type: new Abstract: When designing algorithms for geometric graphs, exploiting structural parameters can lead to significantly improved bounds. Two prominent parameters in this context are…
arXiv:2609.26934v1 Announce Type: new Abstract: We study the problem of constructing metric spanners in general metric spaces in subquadratic time when given blackbox access to a fast algorithm for batch approximate…
arXiv:2609.27440v1 Announce Type: new Abstract: Let $G$ be the line graph of a finite simple graph, with $n\geq1$ vertices and maximum degree $\Delta$. We prove that single-site Glauber dynamics for uniform proper…
arXiv:2609.28128v1 Announce Type: cross Abstract: One item set evaluated at two capacities $R
arXiv:2606.29336v2 Announce Type: replace Abstract: Cycle rank is a depth parameter for digraphs introduced by Eggan in 1963. Gruber (DMTCS 2012) and Giannopoulou, Hunter, and Thilikos (DAM 2012) asked whether the…
arXiv:2605.21738v2 Announce Type: replace-cross Abstract: Motivated by fast matrix multiplication and recent connections between asymptotic tensor rank and fine-grained complexity, we revisit classical tools from the…
arXiv:2609.27797v1 Announce Type: new Abstract: The Minimum $k$-Cut problem asks for a minimum-weight set of edges whose removal leaves an undirected weighted graph with at least $k$ connected components. We consider…
arXiv:2407.07058v5 Announce Type: replace Abstract: We provide an efficient $ O(n^2) $ implementation for solving the all pairs minimax path problem or widest path problem in an undirected dense graph. It is a code…
arXiv:2609.27921v1 Announce Type: new Abstract: In the Shortest Common Superstring problem (SCS), one is given a finite set of strings and is asked to find a shortest string containing every input string as a substring.…
arXiv:2609.26197v2 Announce Type: replace Abstract: We give an approximate sampler for ferromagnetic Ising models with no field on arbitrary graphs that runs in time $\widetilde O(m+n)+\widetilde O_\beta(n^2\log^2 (1 /…
arXiv:2609.28472v1 Announce Type: cross Abstract: The Girard--Hutchinson estimator provides an extremely simple randomized estimate of the Frobenius norm of a matrix $A$ that can only be accessed implicitly via…
arXiv:2609.23994v1 Announce Type: cross Abstract: Ultra-log-concave distributions are ubiquitous in probability, combinatorics, and statistical mechanics and have been studied extensively. In this paper, we introduce a…
Showing 1 day · 56 items available
