BetterScholar BetterScholar

V. Vazirani

Symposium on the Theory of Computing, IEEE Annual Symposium on Foundations of Computer Science, JACM, Theoretical Computer Science, 21st Annual Symposium on Foundations of Computer Science, SIAM journal on computing, Springer Berlin Heidelberg, Algorithmica, The 43rd Annual IEEE Symposium on Foundations of Computer Science, . Proceedings. Show more
13
Role
Title
Level Year L/R
🐢 Random Generation of Combinatorial Structures from a Uniform Distribution
M. Jerrum, L. Valiant, V. Vazirani 		10 1986
10
🐢
🐢 AdWords and generalized on-line matching
Aranyak Mehta, A. Saberi, U. Vazirani, V. Vazirani 		9 2005
9
🐢
🐢 Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation
K. Jain, V. Vazirani 		9 2001
9
🐢
🐢 An optimal algorithm for on-line bipartite matching
R. Karp, U. Vazirani, V. Vazirani 		9 1990
9
🐢
🐢 Matching is as easy as matrix inversion
K. Mulmuley, U. Vazirani, V. Vazirani 		9 1987
9
🐢
🐢 NP is as easy as detecting unique solutions
L. Valiant, V. Vazirani 		9 1985
9
🐢
🐢 An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
S. Micali, V. Vazirani 		9 1980
9
🐢
🐬 Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
K. Jain, Mohammad Mahdian, E. Markakis, A. Saberi, V. Vazirani 		8 2002
8
🐬
🐬 Approximate max-flow min-(multi)cut theorems and their applications
Naveen Garg, V. Vazirani, M. Yannakakis 		8 1993
8
🐬
🦁 Approximation Algorithms
V. Vazirani 		8 2001
8
🦁
🐬 Primal-dual approximation algorithms for integral flow and multicut in trees
Naveen Garg, V. Vazirani, M. Yannakakis 		8 1997
8
🐬
🐢 Market equilibrium via a primal-dual-type algorithm
Nikhil R. Devanur, C. Papadimitriou, A. Saberi, V. Vazirani 		8 2002
8
🐢
🐢 An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs
S. Micali, V. Vazirani 		8 1980
8
🐢