Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs.

Bugra Caskurlu Vahan Mkrtchyan Ojas Parekh K. Subramani

Published in: SIAM J. Discret. Math. (2017)

Keyphrases

bipartite graph
vertex cover
planar graphs
approximation algorithms
maximum matching
minimum weight
partial order
link prediction
precedence constraints
optimality criterion
maximum cardinality
online algorithms
worst case
polynomial time approximation
np hard
branch and bound algorithm
upper bound
social networks