Vazirani, Vijay V.
Overview
Works:  34 works in 150 publications in 4 languages and 1,514 library holdings 

Genres:  Conference papers and proceedings Academic theses 
Roles:  Author, Editor, Creator 
Classifications:  QA76.9.A43, 005.1 
Publication Timeline
.
Most widely held works by
Vijay V Vazirani
Approximation algorithms by
Vijay V Vazirani(
Book
)
63 editions published between 1998 and 2012 in 5 languages and held by 663 WorldCat member libraries worldwide
"This book will be of interest to the scientific community at large and in particular, to students and researchers in Computer Science, Operations Research, and Discrete Mathematics. It can be used both as a text in a graduate course on approximation algorithms and as a supplementary text in basic undergraduate and graduate courses on algorithms."Jacket
63 editions published between 1998 and 2012 in 5 languages and held by 663 WorldCat member libraries worldwide
"This book will be of interest to the scientific community at large and in particular, to students and researchers in Computer Science, Operations Research, and Discrete Mathematics. It can be used both as a text in a graduate course on approximation algorithms and as a supplementary text in basic undergraduate and graduate courses on algorithms."Jacket
Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrücken, Germany,
September 58, 2000 : proceedings by
Klaus Jansen(
Book
)
22 editions published between 2000 and 2002 in English and held by 236 WorldCat member libraries worldwide
Selected papers from APPROX '98, held July 1819, 1998, University of Aalborg, Denmark, in conjunction with ICALP '98
22 editions published between 2000 and 2002 in English and held by 236 WorldCat member libraries worldwide
Selected papers from APPROX '98, held July 1819, 1998, University of Aalborg, Denmark, in conjunction with ICALP '98
Random generation of combinatorial structures from a uniform distribution by
Mark Jerrum(
Book
)
3 editions published in 1985 in English and held by 7 WorldCat member libraries worldwide
3 editions published in 1985 in English and held by 7 WorldCat member libraries worldwide
Solving the weighted parity problem for gammoids by reduction to graphic matching by
Po Tong(
Book
)
3 editions published in 1982 in English and held by 6 WorldCat member libraries worldwide
It is shown that the weighted parity problem for gammoids, with matching and transversal matroids as special cases, can be reduced to the weighted graphic matching problem. Since the cycle matroid of a series parallel graph is a gammoid, this means that it is possible to solve the weighted parity problem for the cycle matroid of a series parallel graph by graphic matching
3 editions published in 1982 in English and held by 6 WorldCat member libraries worldwide
It is shown that the weighted parity problem for gammoids, with matching and transversal matroids as special cases, can be reduced to the weighted graphic matching problem. Since the cycle matroid of a series parallel graph is a gammoid, this means that it is possible to solve the weighted parity problem for the cycle matroid of a series parallel graph by graphic matching
Dynamics of three degree of freedom kinematic chain by
Berthold Horn(
Book
)
1 edition published in 1977 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1977 in English and held by 5 WorldCat member libraries worldwide
Random polynomial time is equal to semirandom polynomial time by
Umesh Virkumar Vazirani(
Book
)
3 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
We prove that any onesided error random polynomial time (RP) algorithm can be simulated with a semirandom source at no more than polynomial factor loss in efficiency. i.e. RP=SRP. This contrasts with the fact that a semirandom source is too weak to simulate fair coin flips [SV]
3 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
We prove that any onesided error random polynomial time (RP) algorithm can be simulated with a semirandom source at no more than polynomial factor loss in efficiency. i.e. RP=SRP. This contrasts with the fact that a semirandom source is too weak to simulate fair coin flips [SV]
Algorithmic game theory(
Book
)
5 editions published between 2007 and 2013 in English and held by 5 WorldCat member libraries worldwide
With contributions from major researchers in the field, 'Algorithmic Game Theory' presents a comprehensive treatment of this important practical application
5 editions published between 2007 and 2013 in English and held by 5 WorldCat member libraries worldwide
With contributions from major researchers in the field, 'Algorithmic Game Theory' presents a comprehensive treatment of this important practical application
Maximun matchings without blossoms by
Vijay V Vazirani(
)
4 editions published in 1984 in English and held by 5 WorldCat member libraries worldwide
4 editions published in 1984 in English and held by 5 WorldCat member libraries worldwide
The twoprocessor scheduling problem is in random NC by
Umesh Virkumar Vazirani(
Book
)
3 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
Abstract: "An efficient parallel algorithm (RNC[superscript 2]) for the twoprocessor scheduling problem is presented. An interesting feature of this algorithm is that it finds a highest level first schedule: such a schedule defines a lexicographically first solution to this problem in a natural way. A key ingredient of the algorithm is a generalization of a theorem of Tutte which establishes a onetoone correspondence between the bases of the Tutte matrix of a graph and the sets of matched nodes in maximum matchings in the graph."
3 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
Abstract: "An efficient parallel algorithm (RNC[superscript 2]) for the twoprocessor scheduling problem is presented. An interesting feature of this algorithm is that it finds a highest level first schedule: such a schedule defines a lexicographically first solution to this problem in a natural way. A key ingredient of the algorithm is a generalization of a theorem of Tutte which establishes a onetoone correspondence between the bases of the Tutte matrix of a graph and the sets of matched nodes in maximum matchings in the graph."
Online algorithms for weighted matching and stable marriages by
Samir Khuller(
Book
)
3 editions published in 1990 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We give an online deterministic algorithm for the bipartite weighted matching problem that achieves a competitive ratio of O(n). In fact, this algorithm is almost optimal  the lower bound on the performance ratio of any deterministic online algorithm is [omega](n/[square root of log n]). We also study the stable marriage problem, where we are interested in the number of unstable pairs produced. We show that the simple 'first come, first served' deterministic algorithm yields on the average O(n log n) unstable pairs, but in the worst case no deterministic or randomized online algorithm can do better than [omega](n²) unstable pairs."
3 editions published in 1990 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We give an online deterministic algorithm for the bipartite weighted matching problem that achieves a competitive ratio of O(n). In fact, this algorithm is almost optimal  the lower bound on the performance ratio of any deterministic online algorithm is [omega](n/[square root of log n]). We also study the stable marriage problem, where we are interested in the number of unstable pairs produced. We show that the simple 'first come, first served' deterministic algorithm yields on the average O(n log n) unstable pairs, but in the worst case no deterministic or randomized online algorithm can do better than [omega](n²) unstable pairs."
NC algorithms for comparability graphs, interval graphs, and unique perfect matchings by
Dexter Kozen(
Book
)
4 editions published in 1986 in English and held by 4 WorldCat member libraries worldwide
4 editions published in 1986 in English and held by 4 WorldCat member libraries worldwide
Processor efficient parallel algorithms for the two disjoint paths problem, and for finding a Kuratowski homeomorph by
Samir Khuller(
Book
)
2 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
We give an $NC$ algorithm for finding vertex disjoint $s_{1}, t_{1}$ and $s_{2}, t_{2}$ paths in an undirected graph $G$. An important step in solving the general problem is solving the planar case. A new structural property yields the parallelization, as well as a simpler linear time sequential algorithm for this case. We extend the algorithm to the nonplanar case by giving an $NC$ algorithm for finding a Kuratowski homeomorph, and, in particular, a homeomorph of $K_{3}, 3$, in a nonplanar graph. Our algorithms are processor efficient; in each case, the processortime product of our algorithms is within a polylogarithmic factor of the best known sequential algorithm
2 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
We give an $NC$ algorithm for finding vertex disjoint $s_{1}, t_{1}$ and $s_{2}, t_{2}$ paths in an undirected graph $G$. An important step in solving the general problem is solving the planar case. A new structural property yields the parallelization, as well as a simpler linear time sequential algorithm for this case. We extend the algorithm to the nonplanar case by giving an $NC$ algorithm for finding a Kuratowski homeomorph, and, in particular, a homeomorph of $K_{3}, 3$, in a nonplanar graph. Our algorithms are processor efficient; in each case, the processortime product of our algorithms is within a polylogarithmic factor of the best known sequential algorithm
Efficient sequential and parallel algorithms for maximal bipartite sets by David Pearson(
Book
)
3 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
Abstract: "A maximal bipartite set (MBS) in an undirected graph G = (V, E) is a maximal collection of vertices B [contained as subclass within] V whose induced subgraph is bipartite. In this paper we present efficient sequential (linear time) and parallel (NC) algorithms for constructing an MBS."
3 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
Abstract: "A maximal bipartite set (MBS) in an undirected graph G = (V, E) is a maximal collection of vertices B [contained as subclass within] V whose induced subgraph is bipartite. In this paper we present efficient sequential (linear time) and parallel (NC) algorithms for constructing an MBS."
Online algorithms for weighted bipartite matching and stable marriages by
Samir Khuller(
Book
)
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide
This appears to be the first online problem for which provably one cannot do better with randomization; for most online problems studied in the past, randomization has helped in improving the performance."
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide
This appears to be the first online problem for which provably one cannot do better with randomization; for most online problems studied in the past, randomization has helped in improving the performance."
Maximum matchings in general graphs through randomization by
Michael O Rabin(
Book
)
2 editions published in 1984 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1984 in English and held by 4 WorldCat member libraries worldwide
Pfaffian orientations, 0/1 permanents, and even cycles in directed graphs by
Vijay V Vazirani(
Book
)
3 editions published in 1987 in English and held by 4 WorldCat member libraries worldwide
The following issues in computational complexity remain imprecisely understood: the striking difference in the complexities of computing the permanent and determinant of a matrix despite their similar looking formulae, the complexity of checking if a directed graph contains an even length cycle, and the complexity of computing the number of perfect matchings in a graph using Pfaffian orientations. Via polynomial time equivalences, we show interrelationships among these issues
3 editions published in 1987 in English and held by 4 WorldCat member libraries worldwide
The following issues in computational complexity remain imprecisely understood: the striking difference in the complexities of computing the permanent and determinant of a matrix despite their similar looking formulae, the complexity of checking if a directed graph contains an even length cycle, and the complexity of computing the number of perfect matchings in a graph using Pfaffian orientations. Via polynomial time equivalences, we show interrelationships among these issues
A theory of alternating paths and blossoms for proving correctness of the O(square root of VE) general graph matching algorithm by
Vijay V Vazirani(
Book
)
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
An optimal algorithm for online bipartite matching by
Richard M Karp(
Book
)
1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide
Planar graph coloring is not selfreducible assuming P [is not equal to] NP by
Samir Khuller(
Book
)
1 edition published in 1989 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 2 WorldCat member libraries worldwide
NC algorithms for computing the number of perfect matchings in K 3,3free graphs and related problems by
Vijay V Vazirani(
Book
)
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 2 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Jansen, Klaus Author Editor
 Leonardi, S. (Stefano) Editor
 Schabanel, Nicolas
 Khuller, Samir Author
 Vazirani, Umesh V. Author
 Mitchell, Stephen G.
 Jerrum, Mark Author
 Valiant, Leslie G.
 Tong, Po Author
 Horn, Berthold Author
Useful Links
Associated Subjects
Algorithms Approximation algorithms Approximation theory Approximation theoryData processing Combinatorial analysis Combinatorial optimizationData processing Computational complexity Computer algorithms Computer graphics Computer science Computer scienceStatistical methods Computer software Data structures (Computer science) Electronic data processing Game theory Graph theory Matching theory Mathematical optimization Matrices Matroids Operations research Parallel processing (Electronic computers) Production scheduling Random graphs University of California, Berkeley.Computer Science Division
Alternative Names
Vazirani, V. V. 1957
Vazirani, Vijay
Vazirani, Vijay 1957
Vazirani, Vijay V.
Vazirani, Vijay Virkumar 1957
Vijay Vazirani American theoretical computer scientist
Vijay Vazirani Amerikaans informaticus
Vijay Vazirani USamerikanischer Informatiker
ویجی وزیرانی
ヴァジラーニ, V. V
Languages
Covers