Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
35 articles · 3 sources · 35 papers ·
Top topics: Algorithms · AI
arXiv:2609.04338v1 Announce Type: new Abstract: The $\ell_p$-Lewis weights of a matrix are defined by a fixed-point equation. For $p<4$, Cohen and Peng [CP15] showed that iterating an equivalent rearrangement of this…
arXiv:2609.04414v1 Announce Type: new Abstract: We consider the Feedback Vertex Set problem (FVS): the input is an undirected graph $G=(V,E)$ and the goal is to find a minimum-cardinality (or a min-cost in the weighted…
arXiv:2609.04825v1 Announce Type: new Abstract: We study exact single-source shortest paths when the output is only the materialized labeled distance vector ($\mathrm{DIST}$), rather than a distance order. In the full…
arXiv:2609.05008v1 Announce Type: new Abstract: We consider the problem of approximately maximizing a weakly submodular function using the standard greedy algorithm, which is known to give tight approximation results…
arXiv:2609.05329v1 Announce Type: cross Abstract: Machine unlearning typically aims to emulate retraining from scratch: upon a deletion request, the unlearning algorithm should produce an outcome that would have been…
arXiv:2609.05057v1 Announce Type: new Abstract: Online resource-allocation systems, like outpatient scheduling and spectrum allocation, often assign sequentially arriving requests to an ordered pool of scarce resources,…
arXiv:2609.05368v1 Announce Type: cross Abstract: In the uniform sparsest cut problem we are asked to find a vertex set that cuts few edges relative to the number of vertex pairs it separates. The Goemans-Linial SDP…
arXiv:2604.26831v2 Announce Type: replace Abstract: We introduce a generalized family of $\left( 2\cdot \left\lfloor \frac{k}{2} \right\rfloor-1, 2\cdot \left\lceil \frac{k}{2} \right\rceil \cdot W_{1}…
arXiv:2609.04890v1 Announce Type: cross Abstract: Graphs are a standard representation for data in the social sciences, cybersecurity, computer infrastructure, bioinformatics, and more. Typical real-world graphs are…
arXiv:2609.05017v1 Announce Type: cross Abstract: We study linear codes for insertion and deletion (insdel) errors through the lens of evaluation codes. We develop a general framework for analyzing random puncturings of…
arXiv:2609.05132v1 Announce Type: cross Abstract: The strategic facility location problem is defined as follows: $n$ agents report their location in a metric space, and the objective is to design a \emph{mechanism}…
arXiv:2609.04389v1 Announce Type: new Abstract: We study the multiobjective hypergraph min-cut problem: Given a hypergraph $H=(V,E)$ and $k$ cost functions $c_1, c_2, \ldots, c_k:E\to\mathbb{Z}_{\ge 0}$, the goal is to…
arXiv:2507.10467v5 Announce Type: replace-cross Abstract: We introduce the notion of colorful minors, which generalizes the classical concept of rooted minors in graphs. A $q$-colorful graph= is defined as a pair $(G,…
arXiv:2609.04505v1 Announce Type: new Abstract: In this paper, we study several statistical problems on similarity graphs in the node-arrival streaming model, including degree moments, diversity index, degree-moment…
arXiv:2609.04787v1 Announce Type: cross Abstract: Learning-augmented algorithms use fallible predictions while retaining formal performance guarantees. This survey synthesizes prediction interfaces, error measures,…
arXiv:2608.08260v2 Announce Type: replace Abstract: We give a randomised algorithm for Equal Subset Sum that, on $n$ arbitrary integers of at most $m\le2^n$ bits, runs in time $O\big((5/3)^n\mathrm{poly}(n)+n^2m\big)$,…
arXiv:2609.03574v2 Announce Type: replace Abstract: We study the basic problem of approximating the number of spanning trees of a graph. We propose an algorithm that approximates the number of spanning trees in…
arXiv:2509.25150v3 Announce Type: replace-cross Abstract: We study popular matchings in three classical settings: the house allocation problem, the marriage problem, and the roommates problem. In the popular matching…
arXiv:2601.04040v3 Announce Type: replace-cross Abstract: The spread of a vertex $v$ in a tree decomposition is the number of bags that contain $v$. We study the trade-off between spread and width in tree…
arXiv:2609.04521v1 Announce Type: new Abstract: Karger's elegant random contraction algorithm for finding a global mincut in a graph has been highly influential. More recent work has obtained several different…
Showing 1 day · 35 items available
