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:2606.01190v3 Announce Type: replace Abstract: In recent years, there has been a renewed interest in the search for low density minimizer schemes. These schemes take a window of $w$ consecutive $k$-mers, and sample…
arXiv:2608.26337v1 Announce Type: new Abstract: We consider the buy-at-bulk facility location problem (BBFL), a problem combining the classic facility location problem with buy-at-bulk network design, which finds…
arXiv:2608.26257v1 Announce Type: cross Abstract: In this paper, we investigate the low-depth circuit complexity of Group Isomorphism in the multiplication (Cayley) table model. We prove the first circuit lower bounds…
arXiv:2608.26360v1 Announce Type: new Abstract: The time-dependent traveling salesman problem with time windows (TDTSPTW) generalizes the well-known traveling salesman problem with time windows by accounting the effects…
arXiv:2511.10777v4 Announce Type: replace-cross Abstract: One-bit compressed sensing (1bCS) addresses the recovery of sparse signals from highly quantized measurements, retaining only the sign of each linear…
arXiv:2608.26047v2 Announce Type: replace Abstract: We study strong coresets for $\ell_p$ subspace approximation. Given a matrix $A\in\mathbb{R}^{n\times d}$, the goal is to sample and rescale a small number of its rows…
arXiv:2608.27096v1 Announce Type: new Abstract: A track layout of a graph is a partition of its vertices into linearly ordered independent sets, called tracks, such that no two edges between the same pair of tracks…
arXiv:2608.26952v1 Announce Type: new 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 Dijkstra's…
arXiv:2608.26894v1 Announce Type: cross Abstract: We revisit a degree-only arc Hamiltonian for fixed-fleet, homogeneous, uncapacitated vehicle routing. Because its local penalties define only a cycle cover, ground…
arXiv:2608.27153v1 Announce Type: cross Abstract: Correlation Clustering (CC) is a natural formulation of clustering in combinatorial optimization, which uses a graph representation of the input and does not require a…
arXiv:2608.26981v1 Announce Type: new Abstract: We study the zero-error randomized query complexity of finding all minimal elements in an unknown $n$-element poset of width at most $w$. Previous work of Daskalakis,…
arXiv:2604.11938v2 Announce Type: replace Abstract: Sampling graph colorings via local Markov chains is a central problem in approximate counting and Markov chain Monte Carlo (MCMC). We address the problem of sampling a…
arXiv:2603.25642v2 Announce Type: replace Abstract: In the NP-hard Group Closeness Centrality Maximization problem, the input is a graph $G = (V,E)$ and a positive integer $k$, and the task is to find a set $S \subseteq…
arXiv:2604.25681v3 Announce Type: replace Abstract: Priority queues are data structures that maintain a dynamic collection of elements and allow inserting new elements and removing the smallest element. The most widely…
arXiv:2608.26488v1 Announce Type: new Abstract: Updating a graph by inserting or replacing nodes while preserving semantics and reusing existing structure is a recurring computational problem. In population genetics,…
arXiv:2305.01420v5 Announce Type: replace Abstract: The online bisection problem is a natural dynamic variant of the classic bisection problem, where one has to dynamically maintain a partition of $n$ elements into two…
arXiv:2608.26552v1 Announce Type: new Abstract: Randomized sketch-and-solve algorithms accelerate overconstrained $\ell_2$ regression by replacing the input with a smaller problem. Standard subspace embeddings guarantee…
arXiv:2608.22247v3 Announce Type: replace Abstract: Let $k_{1,\varepsilon}(n)$ be the smallest number of real linear measurements needed by a randomized oblivious sketch that estimates the nuclear norm of every fixed…
arXiv:2606.03929v2 Announce Type: replace Abstract: Colinear chaining is a classical heuristic for sequence alignment: it enables scalable genome comparison and is a main component of many state-of-the-art read mappers…
arXiv:2608.26599v1 Announce Type: cross Abstract: The permanent of an $n\times n$ $0/1$ matrix $A$ equals the number of perfect matchings in the bipartite graph with edges defined by $A$. Jerrum, Sinclair, and Vigoda…
Showing 1 day · 42 items available
