RE: https://mastodon.green/@gerrymcgovern/116334729524665446
New paper about local temperature impact of AI data centers:
The data heat island effect: quantifying the impact of AI data centers in a warming world
'We're seeing chaos.' Hundreds turned away at Dallas County polls amid switch to precincts (Tracey McManus/Dallas Morning News)
https://www.dallasnews.com/news/elections/2026/03/03/were-seeing-chaos-hundreds-turned-away-at-dallas-county-polls-amid-switch-to-precincts/
http://www.memeorandum.com/260303/p134#a260303p134
🇺🇦 Auf radioeins läuft...
Mieke Miami:
🎵 Cry Baby Cry
#NowPlaying #MiekeMiami
https://funinthechurch.bandcamp.com/track/cry-baby-cry
https://open.spotify.com/track/2zXnNg8ATiqpEBAf335RW9
Zelensky urges maximum pressure on Moscow after massive Russian strike on Ukraine’s energy: https://benborges.xyz/2026/02/03/zelensky-urges-maximum-pressure-on.html
A polynomial-time algorithm for recognizing high-bandwidth graphs
Luis M. B. Varona
https://arxiv.org/abs/2602.01755 https://arxiv.org/pdf/2602.01755 https://arxiv.org/html/2602.01755
arXiv:2602.01755v1 Announce Type: new
Abstract: An unweighted, undirected graph $G$ on $n$ nodes is said to have \emph{bandwidth} at most $k$ if its nodes can be labelled from $0$ to $n - 1$ such that no two adjacent nodes have labels that differ by more than $k$. It is known that one can decide whether the bandwidth of $G$ is at most $k$ in $O(n^k)$ time and $O(n^k)$ space using dynamic programming techniques. For small $k$ close to $0$, this approach is effectively polynomial, but as $k$ scales with $n$, it becomes superexponential, requiring up to $O(n^{n - 1})$ time (where $n - 1$ is the maximum possible bandwidth). In this paper, we reformulate the problem in terms of bipartite matching for sufficiently large $k \ge \lfloor (n - 1)/2 \rfloor$, allowing us to use Hall's marriage theorem to develop an algorithm that runs in $O(n^{n - k 1})$ time and $O(n)$ auxiliary space (beyond storage of the input graph). This yields polynomial complexity for large $k$ close to $n - 1$, demonstrating that the bandwidth recognition problem is solvable in polynomial time whenever either $k$ or $n - k$ remains small.
toXiv_bot_toot
📢 Bundesregierung will Kranke und Kinder aus Nahost zurückholen
Die Bundesregierung bereitet die Rückholung von Kindern, Kranken und Schwangeren unter den im Nahen Osten gestrandeten Deutschen vor. Dazu würden Charter-Maschinen nach Saudi-Arabien und in den Oman geschickt, sagte Außenminister Wadephul.
➡️
Paris prosecutors raid France offices of Elon Musk's X (Liv McMahon/BBC)
https://www.bbc.com/news/articles/ce3ex92557jo
http://www.memeorandum.com/260203/p22#a260203p22