Tootfinder

For Trump,
“it’s no billionaire left behind
— and good luck to everyone else.”
“It’s telling that President Trump has chosen to release his budget on a Friday night with no fanfare whatsoever,”
said Sen. Patty Murray (D-Wash.), ranking member of the Senate Budget Committee,
following the administration’s release of approximately 1,200 pages of budget documents.
“That’s probably because his budget would raise costs for working people,
destroy basic s…

'No Billionaire Left Behind' in Trump Budget Request That Trashes Workers, Struggling Families | Common Dreams
One expert critic said the updated request "confirms once again that the president continues to break his promises to lower families' costs and help people who are struggling to make ends meet."

Improving the average dilation of a metric graph by adding edges
Sariel Har-Peled, Eliot W. Robson
https://arxiv.org/abs/2506.04246 https://

Improving the average dilation of a metric graph by adding edges
For a graph $G$ spanning a metric space, the dilation of a pair of points is the ratio of their distance in the shortest path graph metric to their distance in the metric space. Given a graph $G$ and a budget $k$, a classic problem is to augment $G$ with $k$ additional edges to reduce the maximum dilation. In this note, we consider a variant of this problem where the goal is to reduce the average dilation for pairs of points in $G$. We provide an $O(k)$ approximation algorithm for this proble…

This https://arxiv.org/abs/2410.09425 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
In this paper, the recoverable robust shortest path problem in acyclic digraphs is considered. The interval budgeted uncertainty representation is used to model the uncertain second-stage costs. The computational complexity of this problem has been open to date. In this paper, we prove that the problem is strongly NP-hard even for the case of layered acyclic digraphs. We also show that for the discrete budgeted uncertainty, the problem is not approximable unless P=NP.