Tootfinder

While Xi tours Europe, China feeds Russia's war machine: https://benborges.xyz/2024/05/10/while-xi-tours.html

safe voyages to chiyo kamekawa, bassist for japanese underground legends yura yura teikoku, who passed away this week. yura yura, who broke up in 2010, were kinda like the japanese equivalent of (& friends with) yo la tengo. i'm still exploring their vast, diverse discography, working backwards from 2007's "hollow me." so glad i got to see them on their late career US tours.

元ゆらゆら帝国のベーシスト亀川千代が54歳で死去
亀川千代が2024年4月7日に死去した。亀川千代が亡くなったことは本日4月9日、ギタリストの田畑満によって発表された。亀川の家族のコメントによると、以前から病気の療養中だったという。54歳だった。悲しい...

This only makes sense - sort of - if you've seen the film "Perfect Days".
Tokyo offers toilet tours amid flush of excitement over Wim Wenders’ Oscar hopeful https://www.theguardian.com/world/2024/mar

Equitable Routing -- Rethinking the Multiple Traveling Salesman Problem
Abhay Singh Bhadoriya, Deepjyoti Deka, Kaarthik Sundar
https://arxiv.org/abs/2404.08157

Equitable Routing -- Rethinking the Multiple Traveling Salesman Problem
The Multiple Traveling Salesman Problem (MTSP) with a single depot is a generalization of the well-known Traveling Salesman Problem (TSP) that involves an additional parameter, namely, the number of salesmen. In the MTSP, several salesmen at the depot need to visit a set of interconnected targets, such that each target is visited precisely once by at most one salesman while minimizing the total length of their tours. An equally important variant of the MTSP, the min-max MTSP, aims to distribute…

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

A Hybrid Quantum-assisted Column Generation Algorithm for the Fleet Conversion Problem
The problem of Fleet Conversion aims to reduce the carbon emissions and cost of operating a fleet of vehicles for a given set of tours. It can be modelled as a column generation scheme with the Maximum Weighted Independent Set (MWIS) problem as the slave. Quantum variational algorithms have gained significant interest in the past several years. Recently, a method to represent Quadratic Unconstrained Binary Optimization (QUBO) problems using logarithmically fewer qubits was proposed. Here we use…

Equitable Routing -- Rethinking the Multiple Traveling Salesman Problem
Abhay Singh Bhadoriya, Deepjyoti Deka, Kaarthik Sundar
https://arxiv.org/abs/2404.08157

Equitable Routing -- Rethinking the Multiple Traveling Salesman Problem
The Multiple Traveling Salesman Problem (MTSP) with a single depot is a generalization of the well-known Traveling Salesman Problem (TSP) that involves an additional parameter, namely, the number of salesmen. In the MTSP, several salesmen at the depot need to visit a set of interconnected targets, such that each target is visited precisely once by at most one salesman while minimizing the total length of their tours. An equally important variant of the MTSP, the min-max MTSP, aims to distribute…

If you're someone who's really into themeparks (like a lot); there's this random thing I just stumbled on: https://www.coasterbreaks.com/
Literally a company that does (mostly) all-in theme park tours, going to a different theme park each day for a week -. Hotels and transport incl…

Coaster Breaks | Theme Park Tours
Thrilling small group travel experiences dedicated to theme park tours and roller coaster adventures - Take the ride of your life with Coaster Breaks!

"The new Itasca County #jail includes a two-story display of the Ten Commandments, a choice that's come under fire by many who discovered it and other religious quotes on the walls during recent tours of the northeast #Minnesota facility..."
gift link:

Thou shalt not blend church and state, new Minnesota jail is told
Residents on tours who discovered religious quotes lining cellblock walls of the Grand Rapids facility allege First Amendment violation.

Copying a #DH2024 update over from Bluesky DH 2024 @dh2024.bsky.social
Here is a rundown on some key logistical points to keep in mind when planning your travel, including when early bird registration will open, hotel info, and tours around the D.C. area: https:…

Magic Chess Tours (with Knights and Kings) - Numberphile / Ayliean MacDonald
#Chess

Bob Heil, A groundbreaking audio engineer, he provided the large-scale systems that brought tours by the Who and the Grateful Dead to life, will be missed.
#GiftArticle #Sound #ProAudio

Bob Heil, Whose Innovations Enhanced the Sound of Rock, Dies at 83
A groundbreaking audio engineer, he provided the large-scale systems that brought tours by the Who and the Grateful Dead to life.

‘Shock therapy:’ Foreigners take war tours in Ukraine to see scars of Russia's invasion: https://benborges.xyz/2024/02/29/shock-therapy-foreigners.html

#silentSunday #HorsesOfMastodon
A Budweiser Clydesdale, resting at home. May 2017

The AO Show
Great Australian Pods Podcast Directory: #GreatAusPods

The AO Show | Great Australian Pods Podcast Directory
Podcast: The AO Show By: Australian Open Category: Sport Sub-Category: Tennis First Episode: 2018 Stay up to date with the Australian Open in less than 30 minutes a day! And follow the tours through…

Spanning Euler Tours in Hypergraphs
Amin Bahmanian, Songling Shan
https://arxiv.org/abs/2403.12713 https://arxiv.org/pdf/2403.12713…

Spanning Euler Tours in Hypergraphs
Motivated by generalizations of de Bruijn cycles to various combinatorial structures (Chung, Diaconis, and Graham), we study various Euler tours in set systems. Let $\mathcal{G}$ be a hypergraph whose corank and rank are $c\geq 3$ and $k$, respetively. The minimum $t$-degree of $\mathcal{G}$ is the fewest number of edges containing every $t$-subset of vertices. An Euler tour (family, respectively) in $\mathcal{G}$ is a (family of, respectively) closed walk(s) that (jointly, respectively) traver…

Bob Heil, A groundbreaking audio engineer, he provided the large-scale systems that brought tours by the Who and the Grateful Dead to life, will be missed.
#GiftArticle #Sound #ProAudio

Bob Heil, Whose Innovations Enhanced the Sound of Rock, Dies at 83
A groundbreaking audio engineer, he provided the large-scale systems that brought tours by the Who and the Grateful Dead to life.

I like this "comedy rebels" framing to explain why certain comedians use cancel culture panic as a method of developing an audience.
Also why Lorne Michaels like these guys.
https://www.npr.org/2024/02/25/1233584316/<…

I enjoy #Kygo's music and all but artists should really stop this business of calling their tours "world tour" if it will only be visiting the United States, Canada, and Europe. #smh
#music

Now I have really seen it all 🤦‍♀️🤦‍♀️🤦‍♀️ #nft #blockchain

Explore Uncharted Paths with Touren: Premier Enduro Touring Adventures
Embark on an unforgettable journey with Touren, your gateway to the world’s most exhilarating enduro trails. Discover bespoke tours that blend the thrill of off-road riding with the beauty of unexplored landscapes. Whether you're a seasoned rider or a novice seeking adventure, Touren curates experiences that cater to your spirit of adventure. Join us to traverse through hidden tracks, breathtaking vistas, and unparalleled terrains. Start your next adventure with Touren - where every turn is a…

Y’a rien comme de se moquer de soi-même. Comme j’en suis au début de la soixante-dizaine, je suis réaliste. Ma mémoire va de plus en plus me jouer des tours. Je n’en suis pas encore Š m’inquiéter, mais ne dit-on pas qu’il vaut mieux prévenir.
https://write.as/mimoqc/ou-jai-mis-ca-donc…

Où donc j'ai mis ça ?
Y’a rien comme de se moquer de soi-même. Comme j’en suis au début de la soixante-dizaine, je suis réaliste. Ma mémoire va de plus en plus...

This https://arxiv.org/abs/2211.03564 has been replaced.
link: https://scholar.google.com/scholar?q=a

Cycle decompositions in $k$-uniform hypergraphs
We show that $k$-uniform hypergraphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles, subject to the trivial divisibility conditions. As a corollary, we show those graphs contain tight Euler tours as well. In passing, we also investigate decompositions into tight paths. In addition, we also prove an alternative condition for building absorbers for edge-decompositions of arbitrary $k$-uniform hypergraphs, which should be of independent interest.

Now I have really seen it all 🤦‍♀️🤦‍♀️🤦‍♀️ #nft #blockchain

Explore Uncharted Paths with Touren: Premier Enduro Touring Adventures
Embark on an unforgettable journey with Touren, your gateway to the world’s most exhilarating enduro trails. Discover bespoke tours that blend the thrill of off-road riding with the beauty of unexplored landscapes. Whether you're a seasoned rider or a novice seeking adventure, Touren curates experiences that cater to your spirit of adventure. Join us to traverse through hidden tracks, breathtaking vistas, and unparalleled terrains. Start your next adventure with Touren - where every turn is a…

This https://arxiv.org/abs/2211.03564 has been replaced.
link: https://scholar.google.com/scholar?q=a

Cycle decompositions in $k$-uniform hypergraphs
We show that $k$-uniform hypergraphs on $n$ vertices whose codegree is at least $(2/3 + o(1))n$ can be decomposed into tight cycles, subject to the trivial divisibility conditions. As a corollary, we show those graphs contain tight Euler tours as well. In passing, we also investigate decompositions into tight paths. In addition, we also prove an alternative condition for building absorbers for edge-decompositions of arbitrary $k$-uniform hypergraphs, which should be of independent interest.

A $(5/3 {\epsilon})$-Approximation for Tricolored Non-crossing Euclidean TSP
J\'ulia Balig\'acs, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz
https://arxiv.org/abs/2402.13938

A $(5/3+ε)$-Approximation for Tricolored Non-crossing Euclidean TSP
In the Tricolored Euclidean Traveling Salesperson problem, we are given~$k=3$ sets of points in the plane and are looking for disjoint tours, each covering one of the sets. Arora (1998) famously gave a PTAS based on ``patching'' for the case $k=1$ and, recently, Dross et al.~(2023) generalized this result to~$k=2$. Our contribution is a $(5/3+ε)$-approximation algorithm for~$k=3$ that further generalizes Arora's approach. It is believed that patching is generally no longer possible for more th…

Learning-guided iterated local search for the minmax multiple traveling salesman problem
Pengfei He, Jin-Kao Hao, Jinhui Xia
https://arxiv.org/abs/2403.12389

Learning-guided iterated local search for the minmax multiple traveling salesman problem
The minmax multiple traveling salesman problem involves minimizing the longest tour among a set of tours. The problem is of great practical interest because it can be used to formulate several real-life applications. To solve this computationally challenging problem, we propose a leaning-driven iterated local search approach that combines an aggressive local search procedure with a probabilistic acceptance criterion to find high-quality local optimal solutions and a multi-armed bandit algorithm…

Bis 2019 hat die #StiftungNaturschutz das #Verlandungsmoor an der #KrummenLaake in #Berlin

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

Proving the existence of Euclidean knight's tours on $n \times n \times \cdots \times n$ chessboards for $n < 4$
The Knight's Tour problem consists of finding a Hamiltonian path for the knight on a given set of points so that the knight can visit exactly once every vertex of the mentioned set. In the present paper, we provide a $5$-dimensional alternative to the well-known statement that it is not ever possible for a knight to visit once every vertex of $C(3,k) := \{0,1,2\}^k$ by performing a sequence of $3^k-1$ jumps of standard length, since the most accurate answer to the original question actually dep…

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

Equitable Routing -- Rethinking the Multiple Traveling Salesman Problem
The Multiple Traveling Salesman Problem (MTSP) with a single depot is a generalization of the well-known Traveling Salesman Problem (TSP) that involves an additional parameter, namely, the number of salesmen. In the MTSP, several salesmen at the depot need to visit a set of interconnected targets, such that each target is visited precisely once by at most one salesman while minimizing the total length of their tours. An equally important variant of the MTSP, the min-max MTSP, aims to distribute…

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

Equitable Routing -- Rethinking the Multiple Traveling Salesman Problem
The Multiple Traveling Salesman Problem (MTSP) with a single depot is a generalization of the well-known Traveling Salesman Problem (TSP) that involves an additional parameter, namely, the number of salesmen. In the MTSP, several salesmen at the depot need to visit a set of interconnected targets, such that each target is visited precisely once by at most one salesman while minimizing the total length of their tours. An equally important variant of the MTSP, the min-max MTSP, aims to distribute…

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

Equitable Routing -- Rethinking the Multiple Traveling Salesman Problem
The Multiple Traveling Salesman Problem (MTSP) with a single depot is a generalization of the well-known Traveling Salesman Problem (TSP) that involves an additional parameter, namely, the number of salesmen. In the MTSP, several salesmen at the depot need to visit a set of interconnected targets, such that each target is visited precisely once by at most one salesman while minimizing the total length of their tours. An equally important variant of the MTSP, the min-max MTSP, aims to distribute…