How to find the Vertex Cover of a Vertex-Weighted bipartite graph?

#	User	Rating
1	tourist	3690
2	jiangly	3647
3	Benq	3581
4	orzdevinwang	3570
5	Geothermal	3569
5	cnnfls_csy	3569
7	Radewoosh	3509
8	ecnerwala	3486
9	jqdai0815	3474
10	gyh20	3447

#	User	Contrib.
1	maomao90	174
2	awoo	165
3	adamant	161
4	TheScrasse	160
5	nor	158
6	maroonrk	156
7	-is-this-fft-	152
8	orz	146
9	SecondThread	145
9	pajenegod	145

I recently learnt about Konig's theorem which states that finding the vertex cover in a bipartite graph is equivalent to finding the maximal matching.

Konig's Theorem : http://www.google.co.in/search?q=konig's+theorem

It's simple to edit the hungarian algorithm or any other matching algorithm if it is an unweighted graph. But how do I do the same when it is a "Vertex-Weighted" graph?

pratikmoona's blog