Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
arXiv:2608.24347v1 Announce Type: new Abstract: Clustering is one of the most fundamental tools in data analysis, allowing large datasets to be summarized by a small number of representative points. Given a metric space…
arXiv:2608.24520v1 Announce Type: cross Abstract: It is shown in this manuscript that a random graph $G$ drawn from the Erd\H{o}s--R\'{e}nyi model $\mathcal{G}(n,p)$ with \[ p=p(n)\leq 1/2, \qquad…
arXiv:2608.24527v1 Announce Type: cross Abstract: We prove the first quantum--classical separation for a sampling problem over a continuous domain. For a class of Gibbs states $p\propto e^{-\beta E}$ on the torus…
arXiv:2608.24494v1 Announce Type: cross Abstract: In the problem of ground-state energy estimation, one aims to estimate the smallest eigenvalue of a Hamiltonian, often given a guiding state, with some promised overlap…
arXiv:2601.17425v2 Announce Type: replace Abstract: This paper considers the scheduling of stochastic jobs on parallel identical machines to minimize the expected total weighted completion time. While this is a…
arXiv:2601.18573v2 Announce Type: replace-cross Abstract: In the Stable Marriage and Stable Roommates problems, there are inherent trade-offs between the size and stability of solutions. While in the former problem, a…
arXiv:2608.24493v1 Announce Type: cross Abstract: The guided Hamiltonian problem is the following: given access to the unitary $U=e^{i H}$ for some Hamiltonian $H$, and given access to a unitary that prepares a guiding…
arXiv:2608.24866v1 Announce Type: new Abstract: Affine modular linear hashing is one of the simplest classical hash families. For a prime $p > u$, the hash function is obtained by choosing $s,t$ uniformly from…
arXiv:2608.11038v2 Announce Type: replace Abstract: We study the graphic $s$-$t$ path TSP on subcubic graphs (maximum degree 3): given distinct vertices $s,t$, find a shortest $s$-$t$ walk that visits every vertex. We…
arXiv:2608.24728v1 Announce Type: new Abstract: We show that there exists a polynomial-time algorithm to find a stable matching in network hypergraphic preference systems. The key connection that drives the algorithm…
arXiv:2608.22769v2 Announce Type: replace-cross Abstract: We study spectral density estimation for the normalized adjacency matrix of an unweighted graph under local access model. Previously, Cohen-Steiner et al. [KDD…
arXiv:2608.24380v1 Announce Type: new Abstract: We study the shortest-path problem on graphs with positive real-valued edge weights. Given a source vertex $s$ and a target vertex $t$, the goal is to calculate the length…
arXiv:2607.01007v2 Announce Type: replace Abstract: Given a Wheeler NFA $\mathcal{A}$, the Wheeler determinization problem is to construct a Wheeler DFA $\mathcal{D}$ that accepts the same language as $\mathcal{A}$. We…
arXiv:2608.22413v2 Announce Type: replace Abstract: We prove a strict space separation between static and ordinary dynamic approximate membership at every fixed error rate. For each fixed $\varepsilon\in(0,1)$, a…
arXiv:2608.24630v1 Announce Type: new Abstract: In this paper we study the fractional vertex cover problem on trees in two related models: online and incremental. In the online model, the vertices of the tree are known…
arXiv:2608.23910v1 Announce Type: cross Abstract: Partial optimal transport compares two measures while leaving part of the mass unmatched, which is what makes it robust to outliers, occlusion, and clutter. The quantity…
arXiv:2608.24776v1 Announce Type: new Abstract: We study the \emph{fully dynamic edge orientation problem}, focusing on \emph{worst-case} time bounds. An undirected graph undergoes edge insertions and deletions, and the…
arXiv:2511.20771v4 Announce Type: replace Abstract: Phylogenetic networks allow modeling reticulate evolution, capturing events such as hybridization and horizontal gene transfer. A fundamental computational problem in…
arXiv:2602.12667v2 Announce Type: replace Abstract: Geometric congruence asks whether two point multisets are identical up to translation and rotation, while congruence hashing seeks compact encodings that support…
arXiv:2608.24510v1 Announce Type: new Abstract: The classical Minimum Linear Arrangement (MLA) problem has been studied extensively. It is known to be NP-hard and it admits an $O(\sqrt{\log n}\log\log n)$-approximation…
Showing 1 day · 45 items available
