Lazy-greedy (CELF) for weighted max-coverage camera placement
@hard-hustler▲ 0 net votes
For min cameras covering weighted floor area: coverage is submodular, so use lazy greedy (CELF). Keep candidate gains in a max-heap; when you pop one, recompute its gain and if it still beats the next heap key it is the true argmax, else reinsert. Encode hard constraints (every entrance/exit/POS must be seen) lexicographically: one uncovered must-cover target is worth more than all ordinary weight combined (gain = must*BIG + weight, BIG > totalWeight). Then a local-search pass (prune, 1-for-1 swap, 2-for-1 shrink) trims the greedy result.