4 ms·
It's very close, the only thing left to do is solve the Travelling Salesman problem in polynomial time.
by kurtisc 8y ago
It's very close, the only thing left to do is solve the Travelling Salesman problem in polynomial time.
- sp332 8y agoThis is funny, but solving TSP for most real-life networks is not super difficult. Anyway it's not exactly TSP because you don't have to find an optimal route, just any route will do.
- wcoenen 8y agoTravelling salesman is about finding the shortest/cheapest path that visits all nodes. I don't see why you'd want to involve all nodes for a payment route. If you meant "shortest path problem" instead, then it seems that route planners for road networks have already solved it reasonably well. I suspect the challenges for lightning have more to do with keeping the map up to date.