#### Filter Results:

- Full text PDF available (145)

#### Publication Year

1980

2017

- This year (7)
- Last 5 years (39)
- Last 10 years (77)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

Learn More

- Kamal Jain, Vijay V. Vazirani
- J. ACM
- 2001

We present approximation algorithms for the metric uncapacitated facility location problem and the metric <italic>k</italic>-median problem achieving guarantees of 3 and 6 respectively. The distinguishing feature of our algorithms is their low running time: <italic>O(m</italic> log<italic>m</italic>) and <italic>O(m</italic> log<italic>m(L</italic> + log… (More)

- Leslie G. Valiant, Vijay V. Vazirani
- STOC
- 1985

For all known NP-complete problems the number of solutions in instances having solutions may vary over an exponentially large range. Furthermore, most of the well-known ones, such as satisfiability, are parsimoniously interreducible, and these can have any number of solutions between zero and an exponentially large number. It is natural to ask whether the… (More)

There has been a great deal of interest recently in the relative power of on-line and off-line algorithms. An on-line algorithm receives a sequence of requests and must respond to each request as soon as it is receiveD. An off-line algorithm may wait until all requests have been received before determining its responses. One approach to evaluating an… (More)

- Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani
- Combinatorica
- 1987

A new algorithm for finding a maximum matching in a general graph is presented; its special feature being that the only computationally non-trivial step required in its execution is the inversion of a single integer matrix. Since this step can be parallelized, we get a simple parallel (RNC2) algorithm. At the heart of our algorithm lies a probabilistic… (More)

- Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
- SIAM J. Comput.
- 1993

Consider the multicommodity flow problem in which the object is to maximize the sum of commodities routed. We prove the following approximate max-flow min-multicut theorem: min multicut O(log k) ~ max flow ~ min multicut, where k is the number of commodities. Our proof is constructive; it enables us to find a multicut within O(log k) of the max flow (and… (More)

- Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani
- J. ACM
- 2003

In this article, we will formalize the method of dual fitting and the idea of factor-revealing LP. This combination is used to design and analyze two greedy algorithms for the metric uncapacitated facility location problem. Their approximation factors are 1.861 and 1.61, with running times of <i>O</i>(<i>m</i> log <i>m</i>) and… (More)

- Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani
- 46th Annual IEEE Symposium on Foundations of…
- 2005

How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching problem. We introduce the notion of a trade-off revealing LP and use it to derive an optimal algorithm achieving a competitive ratio of 1−1/<i>e</i> for this problem.

- Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
- Algorithmica
- 1997

We study the maximum integral multicommodity flow problem and the minimum multicut problem restricted to trees. This restriction is quite rich and contains as special cases classical optimization problems such as matching and vertex cover for general graphs. It is shown that both the maximum integral multicommodity flow and the minimum multicut problem are… (More)

- Kamal Jain, Vijay V. Vazirani
- STOC
- 2001

The Internet, which is intrinsically a common playground for a large number of players with varying degrees of collaborative and sel sh motives, naturally gives rise to numerous new game theoretic issues. Computational problems underlying solutions to these issues, achieving desirable economic criteria, often turn out to be NP-hard. It is therefore natural… (More)