Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
45 articles · 3 sources · 45 papers ·
Top topics: Algorithms · AI
arXiv:2610.13010v1 Announce Type: new Abstract: Model minimization is a fundamental problem in formal methods, as smaller models can substantially reduce the complexity of model analysis and reasoning while preserving…
arXiv:2610.12991v1 Announce Type: new Abstract: We study stochastic dynamic matching with abandonment, a fundamental model in which agents of different types arrive over time, may abandon the market while waiting, and…
arXiv:2309.14103v4 Announce Type: replace-cross Abstract: A clique transversal in a graph is a set of vertices intersecting all maximal cliques. The problem of determining the minimum size of a clique transversal has…
arXiv:2607.17590v2 Announce Type: replace Abstract: Recently, Merino and M\"utze (FOCS'23+SICOMP'24) presented an algorithm for computing a Hamilton path on the skeleton of any 0/1-polytope ${\rm conv}(X)$, where…
arXiv:2610.13270v1 Announce Type: new Abstract: Brambles of constant congestion in directed graphs have interesting structural and algorithmic applications, and it is desirable to find the smallest function $f_c(k)$…
arXiv:2610.07623v2 Announce Type: replace-cross Abstract: Probability forecasts are calibrated when predicted probabilities match empirical outcome frequencies: among events assigned a probability $p$, we'd hope that…
arXiv:2610.13937v1 Announce Type: new Abstract: The arboricity of a graph is the minimum number of forests needed to partition its edges. We present a randomized algorithm that computes the exact arboricity of a simple…
arXiv:2610.13717v1 Announce Type: cross Abstract: Federated clustering can support applications such as patient stratification across hospitals and customer segmentation across distributed financial datasets.…
arXiv:2610.12844v1 Announce Type: cross Abstract: We give a polynomial-time randomized classical algorithm that approximates the largest eigenvalue $\lambda_{\max}$ of a traceless quartic fermionic Hamiltonian $H$ on…
arXiv:2610.12938v1 Announce Type: new Abstract: We study static indexes for exact subsequence matching over all equal-length windows of a time series. Under deterministic SETH, for every fixed $\beta\ge1$ and…
arXiv:2609.34339v2 Announce Type: replace Abstract: We study the temporal exploration problem on temporal digraphs. We prove that a lifetime of $O(n^2)$ suffices to guarantee the existence of a temporal exploration on…
arXiv:2610.09050v2 Announce Type: replace Abstract: For the online combinatorial allocation problem with subadditive valuations, Correa and Cristi (STOC 2023) proved the existence of a $6$-competitive online algorithm,…
arXiv:2509.08503v2 Announce Type: replace Abstract: The article focuses on word (or string) attractors, which are sets of positions related to the text compression efficiency of the underlying word. The article presents…
arXiv:2610.12664v1 Announce Type: cross Abstract: We construct exact deterministic circuits for transposing and inverting an unknown qutrit unitary $U\in\mathrm{SU}(3)$ using only forward queries. Three queries prepare…
arXiv:2502.05059v2 Announce Type: replace Abstract: Horiyama et al. (AAAI 2024) studied the problem of generating graph instances that possess a unique minimum vertex cover under specific conditions. Their approach…
arXiv:2610.12953v1 Announce Type: new Abstract: Given an integer $t$ and a set of integers in $[N]$, Subset Sum asks whether there exists a subset that sums to $t$. A long open problem is whether Subset Sum can be…
arXiv:2610.10898v2 Announce Type: replace Abstract: We give a randomized reduction from global minimum cut in a directed graph with $n$ vertices and $m$ weighted edges to maximum-flow computations on graphs of total…
arXiv:2609.15677v2 Announce Type: replace Abstract: $k$-submodularity generalizes submodularity by allowing each selected element to be assigned one of $k$ labels. We study the maximization of a non-monotone…
arXiv:2509.15294v3 Announce Type: replace-cross Abstract: The Binary Paint Shop Problem (BPSP) is an $\mathsf{APX}$-hard optimisation problem arising in automotive manufacturing: given a sequence of $2n$ cars,…
arXiv:2610.13712v1 Announce Type: new Abstract: We study the $k$-Canadian Traveller Problem (k-ctp), an online navigation problem introduced by Papadimitriou and Yannakakis in 1991. Given an undirected weighted graph…
Showing 1 day · 45 items available
