Dependent Rounding in Bipartite Graphs.

Rajiv Gandhi Samir Khuller Srinivasan Parthasarathy Aravind Srinivasan

Published in: FOCS (2002)

Keyphrases

bipartite graph
maximum matching
minimum weight
linear programming
graph clustering
link prediction
maximum cardinality
mutual reinforcement
approximation algorithms
bipartite graph matching
mixed integer
web search engines
random walk
maximum weight
pairwise
information retrieval
data sets