Share This Author
- V. Vazirani
- Computer ScienceSpringer Berlin Heidelberg
- 2 July 2001
Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement…
Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation
A new extension of the primal-dual schema and the use of Lagrangian relaxation to derive approximation algorithms for the metric uncapacitated facility location problem and the metric k-median problem achieving guarantees of 3 and 6 respectively.
An optimal algorithm for on-line bipartite matching
This work applies the general approach to data structures, bin packing, graph coloring, and graph coloring to bipartite matching and shows that a simple randomized on-line algorithm achieves the best possible performance.
NP is as easy as detecting unique solutions
It is shown that the problems of distinguishing between instances of SAT having zero or one solution, or finding solutions to instances of SOTA having unique solutions, are as hard as SAT itself.
AdWords and generalized on-line matching
- Aranyak Mehta, A. Saberi, U. Vazirani, V. Vazirani
- Computer Science46th Annual IEEE Symposium on Foundations of…
- 23 October 2005
The notion of a tradeoff revealing LP is introduced and used to derive two optimal algorithms achieving competitive ratios of 1-1/e for this problem of online bipartite matching.
Matching is as easy as matrix inversion
A new algorithm for finding a maximum matching in a general graph with special feature is that its only computationally non-trivial step is the inversion of a single integer matrix, the isolating lemma.
Random Generation of Combinatorial Structures from a Uniform Distribution
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
The method of dual fitting and the idea of factor-revealing LP are formalized and used to design and analyze two greedy algorithms for the metric uncapacitated facility location problem.
Approximate max-flow min-(multi)cut theorems and their applications
The proof technique provides a unified framework in which one can also analyse the case of flows with specified demands of Leighton and Rao and Klein et al. and thereby obtain an improved bound for the latter problem.
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
- S. Micali, V. Vazirani
- Computer Science21st Annual Symposium on Foundations of Computer…
- 13 October 1980
An 0(√|V|¿|E|) algorithm for finding a maximum matching in general graphs works in 'phases'.