Takip et
Vijay Vazirani
Vijay Vazirani
Distinguished Professor, Dept. of Computer Science, University of California, Irvine.
ics.uci.edu üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
Approximation Algorithms
VV Vazirani
Springer, 2001
62342001
Algorithmic game theory
T Roughgarden
Communications of the ACM 53 (7), 78-86, 2010
56042010
An O (v| v| c| E|) algoithm for finding maximum matching in general graphs
S Micali, VV Vazirani
21st Annual symposium on foundations of computer science (Sfcs 1980), 17-27, 1980
14541980
Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation
K Jain, VV Vazirani
Journal of the ACM (JACM) 48 (2), 274-296, 2001
1361*2001
Random generation of combinatorial structures from a uniform distribution
MR Jerrum, LG Valiant, VV Vazirani
Theoretical computer science 43, 169-188, 1986
13461986
Adwords and generalized online matching
A Mehta, A Saberi, U Vazirani, V Vazirani
Journal of the ACM (JACM) 54 (5), 22-es, 2007
10772007
An optimal algorithm for on-line bipartite matching
RM Karp, UV Vazirani, VV Vazirani
Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990
10451990
Matching is as easy as matrix inversion
K Mulmuley, UV Vazirani, VV Vazirani
Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987
9761987
NP is as easy as detecting unique solutions
LG Valiant, VV Vazirani
Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985
9641985
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
K Jain, M Mahdian, E Markakis, A Saberi, VV Vazirani
Journal of the ACM (JACM) 50 (6), 795-824, 2003
642*2003
Approximate max-flow min-(multi) cut theorems and their applications
N Garg, VV Vazirani, M Yannakakis
SIAM Journal on Computing 25 (2), 235-251, 1996
5751996
Primal-dual approximation algorithms for integral flow and multicut in trees
N Garg, VV Vazirani, M Yannakakis
Algorithmica 18, 3-20, 1997
547*1997
Market equilibrium via a primal-dual-type algorithm
NR Devanur, CH Papadimitriou, A Saberi, VV Vazirani
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002
445*2002
Diversity in times of adversity: probabilistic strategies in microbial survival games
DM Wolf, VV Vazirani, AP Arkin
Journal of theoretical biology 234 (2), 227-253, 2005
3732005
Finding k cuts within twice the optimal
H Saran, VV Vazirani
SIAM Journal on Computing 24 (1), 101-108, 1995
3341995
Multiway cuts in directed and node weighted graphs
N Garg, VV Vazirani, M Yannakakis
International Colloquium on Automata, Languages, and Programming, 487-498, 1994
303*1994
A primal-dual approximation algorithm for generalized Steiner network problems
DP Williamson, MX Goemans, M Mihail, VV Vazirani
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993
2651993
NP-completeness of some generalizations of the maximum matching problem
LJ Stockmeyer, VV Vazirani
Information Processing Letters 15 (1), 14-19, 1982
2641982
Efficient and secure pseudo-random number generation
UV Vazirani, VV Vazirani
Workshop on the Theory and Application of Cryptographic Techniques, 193-202, 1984
2501984
A graph theoretic approach to software watermarking
R Venkatesan, V Vazirani, S Sinha
Information Hiding: 4th International Workshop, IH 2001 Pittsburgh, PA, USA …, 2001
2482001
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20