#### Filter Results:

- Full text PDF available (69)

#### Publication Year

1980

2018

- This year (5)
- Last 5 years (17)
- Last 10 years (38)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Frank Thomson Leighton, Satish Rao
- J. ACM
- 1999

In this paper, we establish max-flow min-cut theorems for several important classes of multicommodity flow problems. In particular, we show that for any n-node multicommodity flow problem withâ€¦ (More)

- Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
- STOC
- 2003

In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This improves upon theâ€¦ (More)

- Frank Thomson Leighton, Satish Rao
- FOCS
- 1988

- Sanjeev Arora, Satish Rao, Umesh V. Vazirani
- J. ACM
- 2009

We give a O(&sqrt;log n)-approximation algorithm for the sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leighton and Raoâ€¦ (More)

- Monika Henzinger, Philip N. Klein, Satish Rao, Sairam Subramanian
- J. Comput. Syst. Sci.
- 1997

- Ingemar J. Cox, Sunita L. Hingorani, Satish Rao, Bruce M. Maggs
- Computer Vision and Image Understanding
- 1996

A stereo algorithm is presented that optimizes a maximum likelihood cost function. The maximum likelihood cost function assumes that corresponding features in the left and right images are Normallyâ€¦ (More)

- Andrew V. Goldberg, Satish Rao
- J. ACM
- 1998

We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our approach leads to anâ€¦ (More)

- Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, Ben Y. Zhao
- Theory of Computing Systems
- 2004

Modern networking applications replicate data and services widely, leading to a need for location-independent routingâ€”the ability to route queries to objects using names independent of the objectsâ€™â€¦ (More)

- Satish Rao
- Symposium on Computational Geometry
- 1999

A finite metric space, (S,d) , contains a finite set of points and a distance function on pairs of points. A contraction is an embedding, h, of a finite metric space (S, d) into Rd where for any u, vâ€¦ (More)

- Philip N. Klein, Serge A. Plotkin, Satish Rao
- STOC
- 1993

In this paper we show that, given a graph and parameters 6 and r, we can find either a K,,. minor or an edge-cut of size O(mT/6) whose removal yields components of weak diameter O(T-26); i.e., everyâ€¦ (More)