In what way is it NP-hard? From what I can gather it just eliminates nodes where... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		OvervCW 12 days ago \| parent \| context \| favorite \| on: Building the largest known Kubernetes cluster 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.

femiagbabiaka 12 days 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 11 days ago | [–]

That's greedy

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact