computation Definition Maximum Non-Blocker Problem Given a weighted graph G and a natural number k. Does G possess a non-blocker with costs ∑e∈Nce≥k?.