Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
36 articles · 3 sources · 36 papers ·
Top topics: Algorithms · AI
arXiv:2609.03890v1 Announce Type: new Abstract: Wang and Sitters' 11/6-approximation for graph balancing is not one algorithm but a set of permitted executions: Step 1 may return any feasible solution of the relaxation…
arXiv:2609.02978v1 Announce Type: new Abstract: The fully independent SparseStack sketch is a vertical stack of $s$ independent CountSketch matrices, scaled by $s^{-1/2}$, so that every column has exactly $s$ nonzero…
arXiv:2609.02977v1 Announce Type: new Abstract: We consider efficient algorithms to learn multiband signals and Fourier-sparse signals. A mutliband signal has a Fourier transform supported by a bounded number of…
arXiv:2609.04079v1 Announce Type: new Abstract: We give deterministic FPTASes for two dense counting problems on which the known deterministic algorithms, based on zero-free interpolation, run in quasipolynomial time.…
arXiv:2609.04059v1 Announce Type: new Abstract: Motivated by numerous parallelizable stochastic search problems, most notable and timely among them being LLM inference-time scaling, we propose and study batched versions…
arXiv:2609.03285v1 Announce Type: new Abstract: We study assortment and procurement design for a digital content platform offering both ad-supported and subscription access. Users are heterogeneous in content…
arXiv:2507.10467v4 Announce Type: replace-cross Abstract: We introduce the notion of colorful minors, which generalizes the classical concept of rooted minors in graphs. A $q$-colorful graph= is defined as a pair $(G,…
arXiv:2609.00678v2 Announce Type: replace-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…
arXiv:2609.03802v1 Announce Type: cross Abstract: The Knaster-Tarski fixed-point theorem states that every monotone function over a complete lattice has a fixed point. Beyond its fundamental role in order theory, the…
arXiv:2509.25150v2 Announce Type: replace-cross Abstract: We study popular matchings in three classical settings: the house allocation problem, the marriage problem, and the roommates problem. In the popular matching…
arXiv:2609.04165v1 Announce Type: cross Abstract: Parameterised graph theory studies how the complexity of graph-theoretic problems depends on structural parameters of the input graph. This perspective has proved useful…
arXiv:2609.03574v1 Announce Type: new Abstract: We study the basic problem of approximating the number of spanning trees of a graph. We propose an algorithm that approximates the number of spanning trees in $\widetilde…
arXiv:2609.03685v1 Announce Type: new Abstract: We study non-adaptive selection of a feasible set $S$ so as to maximize the expected sum of the $k$ largest realized values among independent nonnegative discrete random…
arXiv:2508.21287v4 Announce Type: replace Abstract: Subgraph isomorphism is a fundamental problem in graph analysis that seeks to find all instances of a pattern graph within a larger data graph while preserving…
arXiv:2609.03707v1 Announce Type: cross Abstract: We present our submission to the IJCAI 2025 'Counterfactual Routing Competition' (CRC 25). The goal of the competition is to find counterfactual explanations for the…
arXiv:2307.06776v2 Announce Type: replace Abstract: In this work, we study the Square Min-Sum Bin Packing Problem (SMSBPP), where a list of $n$ square items has to be packed into square bins of dimensions $1 \times 1$…
arXiv:2411.08685v2 Announce Type: replace-cross Abstract: Consider a graph $G$ with a path $P$ of order $n$. What conditions force $G$ to also have a long induced path? As complete bipartite graphs have long paths but…
arXiv:2608.15398v2 Announce Type: replace-cross Abstract: The generalized pancake graph $P(m,n)$ is the Cayley graph of the group of colored permutations $\mathbb{Z}_m\wr S_n=(\mathbb{Z}_m)^n\rtimes S_n$ generated by…
arXiv:2609.04161v1 Announce Type: new Abstract: We study the job shop scheduling problem with a conflict graph (JSC), in which adjacent jobs in the conflict graph cannot be processed simultaneously on different…
arXiv:2609.03896v1 Announce Type: cross Abstract: The way numbers are represented strongly influences which arithmetic structures are easy to see. The \emph{prime clockwork} is a recursively growing discrete dynamical…
Showing 1 day · 36 items available
