A horny queer computer scientist is on holidays and wants to visit all of their partners with minimum time spent in transport and money given to various train companies. They have to solve the Traveling Slut Problem.
Long distance poly relationships aren't just hard, they are NP-hard
@miranda_blue
that sounds like PP-hard (polyamorous polynomial)

@miranda_blue here is the solution:

1. Print out a large map including all locations of partners.

2. Place dog treats on map in the locations of partners.

3. Place small dog in current location of computer scientist.

@miranda_blue I’m still quite proud of the plan I made last year to travel across France during a whole month (it wasn’t easy) 🤓
@ombremad yes, no wonder you're good at algorithms ^^

@ombremad @miranda_blue Oh yea. I keep an excellent memory of these holidays.

Games were played. Relationships were built. Aquariums were visited!

@Abigailmaes (Of the three last statements, one is false, can you guess which one? :D)

@ombremad

@miranda_blue Literally me at this exact instant. Add to this gendered sleeper compartments and the queer in question changing their civil gender between the booking time and boarding time ​​ (btw anyone interested in the NJ402 Zurich->Amsterdam for may 11th?