The maximum vertex coverage problem on bipartite graphs

Given a simple undirected graph GG and a positive integer ss the Maximum Vertex Coverage Problem is the problem of finding a set UU of ss vertices of GG such that the number of edges having at least one endpoint in UU is as large as possible. We prove that the Maximum Vertex Coverage problem on bipartite graphs is NP-hard and discuss several consequences related to known combinatorial optimization problems.