Definition
Maximum Vertex Coverage Optimisation Problem
Instance: A finite simple undirected graph
and a nonnegative integer . Feasible solutions: Vertex sets
with . Objective: Maximise the number of covered edges:
Maximum Vertex Coverage Optimisation Problem
Instance: A finite simple undirected graph
and a nonnegative integer . Feasible solutions: Vertex sets
with . Objective: Maximise the number of covered edges: