Satish Rao
Professor
Computer Science Division
681 Soda Hall
University of California
Berkeley, CA 94720-1776
Phone: (510) 642-4328
Fax: (510) 642-5775
Email:satishr is my username and the hostname is cs.berkeley.edu
Contents : Current Teaching /
Research Interests /
Recent Papers /
Selected Papers /
Contact information /
Other
Research interests
- Design and analysis of algorithms
- Combinatorial optimization
Recent (and not so recent) papers
- Paths, trees and minimizing latency.
- To appear in FOCS 2003. With Kamalika Chaudhuri, Brighten Godfrey, and
Kunal Talwar.
- A tight bound on approximating arbitrary metrics by tree
metrics.
- STOC 2003: 448-455. (With Jittat Fakcharoenphol
and Kunal Talwar)
- Constant factor approximation of vertex-cuts in planar
graphs.
- STOC 2003: 90-99. (With Eyal Amir and Robert Krauthgamer.)
- A polynomial-time tree decomposition to minimize
congestion.
- SPAA 2003. (With Chris Harrelson and Kris Hildrum.)
- The k-Travelling Repairman Problem.
- SODA 2003: 442-452. (With Chris Harrelson and Jittat Fakchaoenphol.)
- An improved approximation algorithm for the
0-extension problem
- SODA 2003: 342-352. (With Chris Harrelson, Jittat Fakcharoenphol,
Satish Rao and Kunal Talwar.)
- Distributed Data Location in a Dynamic Network
- SPAA 2002. (With Kirsten Hildrum, John D. Kubiatowicz and Ben
Y. Zhao)
- Planar graphs, negative weight edges, shortest paths, and near
linear time.
- FOCS 2001: 232-242. (With Jittat
Fakcharoenphol.)
- Scheduling algorithms for input-queued switches: Randomized techniques
and experimental evaluation
- IEEE INFOCOM 2000, Tel Aviv, Israel,
March 2000. (With M. Goudreau and S. Kolliopoulos.)
Selected papers
Random Stuff
Current Teaching
CS270 Spring
2008
CS170
Spring 2008
My notes for
CS170