top | item 46035077 (no title) OvervCW | 3 months ago In what way is it NP-hard? From what I can gather it just eliminates nodes where the pod wouldn't be allowed to run, calculates a score for each and then randomly selects one of the nodes that has the lowest score, so trivially parallelizable. discuss order hn newest femiagbabiaka|3 months ago I think filtering and scoring fall under a heuristics based approach to address NP-hardness?Binpacking seems to be a well-defined NP-hard problem: https://en.wikipedia.org/wiki/Bin_packing_problem stevefan1999|3 months ago That's greedy
femiagbabiaka|3 months ago I think filtering and scoring fall under a heuristics based approach to address NP-hardness?Binpacking seems to be a well-defined NP-hard problem: https://en.wikipedia.org/wiki/Bin_packing_problem
femiagbabiaka|3 months ago
Binpacking seems to be a well-defined NP-hard problem: https://en.wikipedia.org/wiki/Bin_packing_problem
stevefan1999|3 months ago