Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
65 articles · 3 sources · 65 papers ·
Top topics: Algorithms · AI
arXiv:2609.26671v1 Announce Type: new Abstract: In the unrestricted max--min metric $T$-join problem, one seeks an even terminal set $T$ maximizing the cost of a minimum $T$-join. Iwata and Ravi gave a factor-$3/2$…
arXiv:2609.13693v2 Announce Type: replace Abstract: Identifiability criteria certify that a given tensor decomposition is a unique rank decomposition. Kruskal's classical condition is one of the best-known deterministic…
arXiv:2609.25816v1 Announce Type: cross Abstract: A boolean function $f$ has Fourier dimension $k$ if its nonzero Fourier coefficients span a subspace of dimension $k$. We consider the property testing task of…
arXiv:2609.26033v1 Announce Type: cross Abstract: We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix…
arXiv:2609.25180v1 Announce Type: new Abstract: We consider the offline problem of parallel relocation of k identical mobile resources. After each request, known in advance, the resources may move simultaneously, and…
arXiv:2609.26006v1 Announce Type: new Abstract: The Matching-Match puzzle asks whether the vertices of a fixed graph can be colored so that the multiset of color pairs induced by its edges is exactly a prescribed…
arXiv:2606.26244v2 Announce Type: replace-cross Abstract: We investigate ideas from the Geometric Complexity Theory approach to separating complexity classes (Mulmuley & Sohoni, SIAM J. Comput., 2001) in the setting of…
arXiv:2609.25765v1 Announce Type: cross Abstract: The Remote Point Problem (RPP) is an algorithmic problem that asks, given a linear subspace $L \subseteq \mathbb{F}^n$ of dimension $k$, to deterministically find a…
arXiv:2609.26259v1 Announce Type: new Abstract: We study online line aggregation with deadlines, where requests arrive over time on the positive half-line and a service at location $y$ clears all pending requests in…
arXiv:2609.26531v1 Announce Type: new Abstract: The Matching Augmentation Problem (MAP) asks for a minimum-cardinality set of unit-cost edges that, together with a zero-cost matching, forms a 2-edge-connected spanning…
arXiv:2609.07862v3 Announce Type: replace Abstract: This paper presents a high-performance SIMD acceleration framework for the Steinhaus-Johnson-Trotter algorithm, targeted at modern x86-64 architectures using the AVX2…
arXiv:2609.26197v1 Announce Type: new 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…
arXiv:2609.25292v1 Announce Type: new Abstract: In the online metric matching problem, we have $n$ servers with known locations in some metric space. Requests arrive one-by-one at certain locations, and upon arrival a…
arXiv:2604.24135v2 Announce Type: replace-cross Abstract: The Fr\'echet distance is a well-studied similarity measure between curves. We computing the Fr\'echet distance between $\lambda$-low-density curves, the most…
arXiv:2609.25127v1 Announce Type: cross Abstract: In this paper, we determine the precise asymptotics of the number of parts of stable regularity equipartitions in terms of the Littlestone dimension: every graph $G$ of…
arXiv:2609.24569v2 Announce Type: replace Abstract: Over the past decade, a growing body of research has shown that $\gamma$-weak submodularity broadly arises in numerous subset selection tasks, including feature…
arXiv:2609.26017v1 Announce Type: cross Abstract: We study prophet inequalities for a random walk reward stopping problem with sample-based information. The goal is to stop as close as possible to the maximum of a…
arXiv:2609.07204v1 Announce Type: cross Abstract: The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weighted sum of the cut edges. Over…
arXiv:2609.26789v1 Announce Type: new Abstract: We study asynchronous collective tree exploration, where $k$ agents with unrestricted communication start at the root of an unknown tree and discover edges online. At each…
arXiv:2609.26508v1 Announce Type: cross Abstract: Streaming principal component analysis (PCA) seeks to recover a leading spectral subspace in a single pass over a data stream. We give a new analysis of the ubiquitous…
Showing 1 day · 65 items available
