Thanks for the share. I like the idea of forming subroutes/subgraphs, then compare most efficient paths among subgraphs then induct out to global routes. Many graph theory problems are solved this way. Biologically inspired (ant colony) TSP optimization methods are also good.
"Computer scientists have long known how to find a pretty good route — one that incurs no more than 1.5 times the optimal cost [when routes are symmetric]." Now there's also such a good-enough-for-most-purposes solution for asymmetric routes.https://www.quantamagazine.org/one-way-salesman-finds-fast-path-home-20171005/ …
-
-
-
Not too long ago, I was thinking about TSP in the order routing context. I think it’s important for both centralized platforms and the lightning network down the line.https://twitter.com/gaborgurbacs/status/1042738911724883969?s=21 …
End of conversation
New conversation -
-
-
I love the concept of approximation algorithms. First you think you have shown that a certain problem is incredibly hard and impossible to solve perfectly in practice. Then you find out that you can find a provable pretty good solution in a very short amount of time.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
This Tweet is unavailable
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.