Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
76 articles · 3 sources · 76 papers ·
Top topics: Algorithms · AI
arXiv:2609.24684v1 Announce Type: cross Abstract: We establish a strongly sublinear counterpart of a recent result of Chudnovsky, E S, and Lokshtanov (arXiv 2025) on treewidth and tree-independence number. Namely, we…
arXiv:2609.17782v2 Announce Type: replace Abstract: The matroid secretary problem asks an online algorithm to select a high-weight independent set from elements arriving in uniformly random order, with immediate and…
arXiv:2609.23197v1 Announce Type: new Abstract: We study the Busy Machine Time with Preemption and Migration and One Resource Requirement problem, motivated by energy minimization in cloud data centers. Given unlimited…
arXiv:2609.24018v1 Announce Type: cross Abstract: Asynchronous Byzantine Reliable Broadcast (BRB) is a fundamental primitive that guarantees agreement and validity in distributed systems subject to Byzantine faults, but…
arXiv:2609.23489v1 Announce Type: new Abstract: Triangle counting is one of the most fundamental problems in network analysis. Given the massive sizes of real-world graphs, there is a long history of small-space…
arXiv:2609.24804v1 Announce Type: new Abstract: We show that isomorphism of $F$-free tournaments can be solved in FPT time $f(k) \cdot n^{O(1)}$, where $k$ denotes the size of $F$, and $n$ denotes the size of the input…
arXiv:2609.22958v1 Announce Type: cross Abstract: In this paper, we study graph editing problems on geometric intersection graphs. For a tuple $\mathcal{S}=(S_1,\dots,S_n)$ of geometric objects in some Euclidean space,…
arXiv:2302.06506v5 Announce Type: replace-cross Abstract: The model of generalized automata, introduced by Eilenberg in 1974, allows representing a regular language more concisely than conventional automata by allowing…
arXiv:2601.00094v3 Announce Type: replace Abstract: The problem of finding the longest simple cycle in a directed graph is NP-hard, with critical applications in computational biology, scheduling, and network analysis.…
arXiv:2609.20699v2 Announce Type: replace Abstract: We consider a large-scale incentive allocation problem where the entire trade-off curve between budget and profit has to be maintained approximately at all times. The…
arXiv:2609.24780v1 Announce Type: new Abstract: In the planted clique problem, one observes either an Erd\H{o}s--R\'{e}nyi graph on $n$ vertices or such a graph with a clique added to $k = k(n)$ vertices, and seeks to…
arXiv:2609.24624v1 Announce Type: new Abstract: In the vertex cover interdiction problem, we are given an undirected graph $G=(V,E)$, two integers $t$ and $k$ and a vertex subset $B\subseteq V$, and we are asked to find…
arXiv:2609.23947v1 Announce Type: new Abstract: We study Greedy for online metric matching with $n$ servers and $n$ requests sampled independently and uniformly from $[0,1]^d$. Servers are available initially, and…
arXiv:2609.22569v1 Announce Type: new Abstract: Finding an optimal meeting point for a collection of agents on a directed graph is a classical problem studied in the context of network analysis, operations research and…
arXiv:2609.23458v1 Announce Type: new Abstract: For a fixed integer $r\geq4$, the $K_r-e$-free graph sandwich problem asks whether, given graphs $G_1\subseteq G_2$ on the same vertex set, there is an…
arXiv:2609.22892v1 Announce Type: new Abstract: We consider union-find with deletions, where the representation and the cost of a query must depend on the current number of live elements rather than on the number of…
arXiv:2606.17051v2 Announce Type: replace-cross Abstract: We give the first polynomial-time constant-factor approximation of the Gromov-Hausdorff distance d_GH between finite point sets in the Euclidean plane; in fixed…
arXiv:2609.22605v1 Announce Type: new Abstract: In the Directed Steiner Network (DSN) problem we are given a directed graph and a set of demands $(s_i,t_i)$, and asked to find a cheap subgraph connecting each terminal…
arXiv:2609.23669v1 Announce Type: new Abstract: The Directed Feedback Vertex Set problem (DFVS) asks whether a digraph can be made acyclic by deleting at most $k$ vertices. Whether DFVS admits a polynomial kernel…
arXiv:2609.24569v1 Announce Type: new 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 selection,…
Showing 1 day · 76 items available
