Tootfinder

Neighborhood-Aware Graph Labeling Problem
Mohammad Shahverdikondori, Sepehr Elahi, Patrick Thiran, Negar Kiyavash
https://arxiv.org/abs/2602.08098 https://arxiv.org/pdf/2602.08098 https://arxiv.org/html/2602.08098
arXiv:2602.08098v1 Announce Type: new
Abstract: Motivated by optimization oracles in bandits with network interference, we study the Neighborhood-Aware Graph Labeling (NAGL) problem. Given a graph $G = (V,E)$, a label set of size $L$, and local reward functions $f_v$ accessed via evaluation oracles, the objective is to assign labels to maximize $\sum_{v \in V} f_v(x_{N[v]})$, where each term depends on the closed neighborhood of $v$. Two vertices co-occur in some neighborhood term exactly when their distance in $G$ is at most $2$, so the dependency graph is the squared graph $G^2$ and $\mathrm{tw}(G^2)$ governs exact algorithms and matching fine-grained lower bounds. Accordingly, we show that this dependence is inherent: NAGL is NP-hard even on star graphs with binary labels and, assuming SETH, admits no $(L-\varepsilon)^{\mathrm{tw}(G^2)}\cdot n^{O(1)}$-time algorithm for any $\varepsilon>0$. We match this with an exact dynamic program on a tree decomposition of $G^2$ running in $O\!\left(n\cdot \mathrm{tw}(G^2)\cdot L^{\mathrm{tw}(G^2) 1}\right)$ time. For approximation, unless $\mathsf{P}=\mathsf{NP}$, for every $\varepsilon>0$ there is no polynomial-time $n^{1-\varepsilon}$-approximation on general graphs even under the promise $\mathrm{OPT}>0$; without the promise $\mathrm{OPT}>0$, no finite multiplicative approximation ratio is possible. In the nonnegative-reward regime, we give polynomial-time approximation algorithms for NAGL in two settings: (i) given a proper $q$-coloring of $G^2$, we obtain a $1/q$-approximation; and (ii) on planar graphs of bounded maximum degree, we develop a Baker-type polynomial-time approximation scheme (PTAS), which becomes an efficient PTAS (EPTAS) when $L$ is constant.
toXiv_bot_toot

🇺🇦 #NowPlaying on #BBC6Music's #NickGrimshaw
Altın Gün:
🎵 Zülüf Dökülmüş Yüze
#AltınGün
#newRelease 🆕 single
https://altingun.bandcamp.com/track/z-l-f-d-k-lm-y-ze
https://open.spotify.com/track/3MqM4mzHo5OSrJtszm0V64

Democratic senator Chris Van Hollen, viewed as a potential 2028 presidential candidate, will unveil a plan that he says would ensure roughly half of all U.S. workers pay no federal income taxes.

Sen. Chris Van Hollen of Maryland is expected to release the measure next week as Democratic lawmakers search for a sharp economic message to counter last year’s Republican tax law.

Under Van Hollen’s proposal, workers making at or below a “living wage”
— $46,000 for taxpayers filin…

Democrat’s plan would eliminate federal income taxes for half of U.S. workers
Sen. Chris Van Hollen’s tax relief plan could benefit tens of millions of middle-class workers, with a focus on those making at or below a living wage.

Every story I've seen on congestion charging is similar:
"Traffic is down, business is up, and we’re making crucial investments in a transit system that moves millions of people a day,” Janno Lieber, the MTA’s CEO, said on Tuesday. “New York is winning.”
Trump administration’s bid to halt New York City congestion toll blocked in court

Every story I've seen on congestion charging is similar:
"Traffic is down, business is up, and we’re making crucial investments in a transit system that moves millions of people a day,” Janno Lieber, the MTA’s CEO, said on Tuesday. “New York is winning.”
Trump administration’s bid to halt New York City congestion toll blocked in court

🇺🇦 #NowPlaying on BBCRadio3's #InTune
Maurice Ravel, Mason Jones & Ensemble Ouranos:
🎵 Le tombeau de Couperin, M. 68: I. Prélude
#MauriceRavel #MasonJones #EnsembleOuranos
https://open.spotify.com/track/5qKrNrhbbffPlikrNZI8NN