Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
38 articles · 3 sources · 38 papers ·
Top topics: Algorithms · AI · Information Retrieval
arXiv:2608.13318v2 Announce Type: replace Abstract: In restricted assignment - makespan minimization where each job has one size and a set of allowed machines - the configuration LP is the tightest studied relaxation,…
arXiv:2607.02883v2 Announce Type: replace Abstract: We study two inverse problems for shortest-path metrics of Okamura-Seymour instances: recognizing metrics realizable by outerplanar graphs, and computing minimum-edge…
arXiv:2609.10885v1 Announce Type: cross Abstract: The small-world phenomenon was given an algorithmic foundation by Kleinberg, who showed that in an augmented $k$-dimensional lattice a decentralized greedy algorithm…
arXiv:2606.25827v3 Announce Type: replace Abstract: We study the following distance realization problem: given a metric $D$ on a set $T$ of terminals, does there exist an (edge-weighted) outerplanar graph $G$, such that…
arXiv:1810.04449v4 Announce Type: replace-cross Abstract: We introduce a Hamiltonian Monte Carlo (HMC) methodology based on an offline empirical calibration of randomized leapfrog parameters. The approach, referred to…
arXiv:2609.10921v1 Announce Type: new Abstract: Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC)…
arXiv:2609.11207v1 Announce Type: cross Abstract: Convex Optimization with Nested Evolving Feasible Sets (CONES)} was introduced in \cite{CONESVaze} where the objective function \(f\) remains fixed but the feasible…
arXiv:2609.11621v1 Announce Type: new Abstract: Robust optimization under interval uncertainty aims to compute solutions that perform well on a range of scenarios that are described by interval-constrained costs. In…
arXiv:2609.10877v1 Announce Type: new Abstract: This paper studies fundamental graph optimization problems under differential privacy (DP) and shows new, reconstruction-based lower bounds. We consider a graph $G = (V,…
arXiv:2609.11160v1 Announce Type: new Abstract: Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is…
arXiv:2608.07073v2 Announce Type: replace Abstract: Consider a poset - or equivalently an $n$-vertex DAG $G=(V, E)$ - and a boolean function $f: V \rightarrow \{0, 1\}$ on its vertex set. We say $f$ is monotone if $f(u)…
arXiv:2505.02977v3 Announce Type: replace-cross Abstract: Incomplete Cholesky (IC) preconditioners are the standard black-box, memory-efficient first resort for large graph Laplacian systems, but classical IC can break…
arXiv:2609.03890v2 Announce Type: replace Abstract: Wang and Sitters' 11/6-approximation for graph balancing is not one algorithm but a set of permitted executions: Step 1 may return any feasible solution of the…
arXiv:2609.10641v1 Announce Type: new Abstract: In Polyamorous Scheduling Problem, we are given an edge-weighted graph and must find a periodic schedule of matchings in this graph which minimizes the maximal weighted…
arXiv:2609.11836v1 Announce Type: cross Abstract: Let $A_1,\ldots,A_n$ be independent $d \times d$ real symmetric Gaussian random matrices, and consider the linear operator $A(x) = n^{-1/2}\sum_{i=1}^n x_i A_i$, $x\in…
arXiv:2503.02566v2 Announce Type: replace Abstract: Hub Covering Problems are a subclass of Hub Location Problems. The objective is to select a set of hubs that enable paths between given origin-destination delivery…
arXiv:2601.18602v2 Announce Type: replace-cross Abstract: Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$…
arXiv:2209.06404v3 Announce Type: replace-cross Abstract: We determine the exact extension threshold for one-factorizations of complete tripartite $3$-uniform hypergraphs. Equivalently, for $n>m$, every order-$m$…
arXiv:2607.23111v3 Announce Type: replace Abstract: A numerical semigroup is a subset of the nonnegative integers, closed under addition and with finite complement. The size of the complement is its genus. The problem…
arXiv:2603.23070v2 Announce Type: replace-cross Abstract: The House of Graphs is an online database of graphs which can be accessed at https://houseofgraphs.org/. It serves as a central repository for complete lists of…
Showing 1 day · 38 items available
