Vazirani, Vijay V.Overview
Publication Timeline
Most widely held works by
Vijay V Vazirani
Approximation algorithms
by Vijay V Vazirani
(
Book
)
28 editions published between 2001 and 2011 in English and Undetermined and held by 517 WorldCat member libraries worldwide "The challenge met by this book is to capture the beauty and excitement of work in this thriving field and to convey in a lucid manner the underlying theory and methodology. Many of the research results presented have been simplified, and new insights provided. Perhaps the most important aspect of the book is that it shows simple ways of talking about complex, powerful algorithmic ideas by giving intuitive proofs, by writing algorithms in plain English, and by providing numerous critical examples and illustrations."
Algorithmes d'approximation
by Vijay V Vazirani
(
)
18 editions published between 2006 and 2007 in French and English and held by 453 WorldCat member libraries worldwide
Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrücken, Germany, September 58, 2000 : proceedings
by Klaus Jansen
(
Book
)
10 editions published in 2002 in English and held by 285 WorldCat member libraries worldwide Selected papers from APPROX '98, held July 1819, 1998, University of Aalborg, Denmark, in conjunction with ICALP '98
Algorithmic game theory
by Noam Nisan
(
)
3 editions published between 2007 and 2008 in English and held by 9 WorldCat member libraries worldwide The latest in algorithmic game theory, with contributions from all the leading researchers
Online algorithms for weighted bipartite matching and stable marriages
by Samir Khuller
(
Book
)
3 editions published between 1990 and 1991 in English and held by 8 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."
Dynamics of three degree of freedom kinematic chain
by Berthold Horn
(
Book
)
3 editions published in 1977 in English and held by 6 WorldCat member libraries worldwide In order to be able to design a control system for highspeed control of mechanical manipulators, it is necessary to understand properly their dynamics. An analysis is presented here of a detailed model of a threelink device which may be viewed as either a leg in a locomotory system, or the first three degrees of freedom of an arm providing for its gross motions. The equations of motion are shown to be nontrivial, yet manageable
Random generation of combinatorial structures from a uniform distribution
by Mark Jerrum
(
Book
)
2 editions published in 1985 in Undetermined and English and held by 6 WorldCat member libraries worldwide
Solving the weighted parity problem for gammoids by reduction to graphic matching
by Po Tong
(
Book
)
1 edition published in 1982 in English and held by 5 WorldCat member libraries worldwide
Random polynomial time is equal to semirandom polynomial time
by Umesh Virkumar Vazirani
(
Book
)
2 editions published in 1988 in English and held by 4 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]
Maximum matchings in general graphs through randomization
by Michael Oser Rabin
(
Book
)
2 editions published in 1984 in English and held by 4 WorldCat member libraries worldwide
Efficient sequential and parallel algorithms for maximal bipartite sets
by David Pearson
(
Book
)
2 editions published in 1991 in English and held by 3 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."
The twoprocessor scheduling problem is in random NC
by Umesh Virkumar Vazirani
(
Book
)
1 edition published in 1989 in English and held by 3 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."
Pfaffian orientations, 0/1 permanents, and even cycles in directed graphs
by Vijay V Vazirani
(
Book
)
2 editions published in 1987 in English and held by 3 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
NC algorithms for comparability graphs, interval graphs, and unique perfect matchings
by Dexter Kozen
(
Book
)
3 editions published in 1986 in English and Undetermined and held by 3 WorldCat member libraries worldwide
Processor efficient parallel algorithms for the two disjoint paths problem, and for finding a Kuratowski homeomorph
by Samir Khuller
(
Book
)
1 edition published in 1989 in English and held by 3 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
Kinji arugorizumu
(
Book
)
2 editions published in 2002 in Japanese and held by 3 WorldCat member libraries worldwide
NC algorithms for computing the number of perfect matchings in K3,3 [in subscripts]free graphs and related problems
by Vijay V Vazirani
(
Book
)
2 editions published in 1987 in English and held by 2 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
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
)
1 edition published in 1989 in English and held by 2 WorldCat member libraries worldwide
Maximun matchings without blossoms
by Vijay V Vazirani
(
Book
)
2 editions published in 1984 in English and held by 2 WorldCat member libraries worldwide more
fewer
Audience Level
Related Identities
Associated Subjects
Algorithms Approximation algorithms 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 Mathematics 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 1957
Vazirani, Vijay V.
Vazirani, Vijay Virkumar 1957
ヴァジラーニ, V. V
Languages
Covers
