Virgile Andreani on Nostr: This doesn't mean that we cannot have a stab at it! But this will have to be either ...
This doesn't mean that we cannot have a stab at it!
But this will have to be either with an approximation algorithm (fast but suboptimal), or with an optimized solver that can tackle NP-hard problems (with an extremely optimized brute-force method, essentially).
We didn't go too far on the approximation algorithm side, because some had already been proposed by others. Instead, we focused on how to obtain an optimal solution as efficiently as possible.
🧵 4/7
But this will have to be either with an approximation algorithm (fast but suboptimal), or with an optimized solver that can tackle NP-hard problems (with an extremely optimized brute-force method, essentially).
We didn't go too far on the approximation algorithm side, because some had already been proposed by others. Instead, we focused on how to obtain an optimal solution as efficiently as possible.
🧵 4/7