#### Filter Results:

- Full text PDF available (56)

#### Publication Year

1969

2019

- This year (3)
- Last 5 years (21)
- Last 10 years (50)

#### Supplemental Content

#### 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)

- 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)

- Frank Thomson Leighton, Satish Rao
- [Proceedings ] 29th Annual Symposium on…
- 1988

A multicommodity flow problem is considered where for each pair of vertices (u, v) it is required to send f half-units of commodity (u, v) from u to v and f half-units of commodity (v, u) from v to u… (More)

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

We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph… (More)

- 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)

- Jonathan M. D. Hill, William F. McColl, +6 authors Rob H. Bisseling
- Parallel Computing
- 1998

BSPlib is a small communications library for bulk synchronous parallel (BSP) programming which consists of only 20 basic operations. This paper presents the full definition of BSPlib in C, motivates… (More)

- Jittat Fakcharoenphol, Satish Rao
- Proceedings IEEE International Conference on…
- 2001

The authors present an O(n log/sup 3/ n) time algorithm for finding shortest paths in a planar graph with real weights. This can be compared to the best previous strongly polynomial time algorithm… (More)