Travelled to:1 × Hungary
1 × Italy
4 × USA
Collaborated with:R.Rajaraman J.Chen M.V.Marathe R.Ravi S.S.Ravi R.V.Guha R.Kumar D.Sivakumar L.Jia G.Lin G.Noubir R.D.Kleinberg L.Lovász A.Vetta D.J.Rosenkrantz H.B.H.III S.O.Krumke H.Noltemeier H.Wirth
Talks about:confluent (2) approxim (2) tree (2) flow (2) bicriteria (1) algorithm (1) document (1) univers (1) theorem (1) steiner (1)
Person: Ravi Sundaram
DBLP: Sundaram:Ravi
Contributed to:
2005
200520042003
19971995Wrote 6 papers:
- KDD-2005-GuhaKSS #documentation #weaving #web
- Unweaving a web of documents (RVG, RK, DS, RS), pp. 574–579.
- STOC-2005-JiaLNRS #approximate #set
- Universal approximations for TSP, Steiner tree, and set cover (LJ, GL, GN, RR, RS), pp. 386–395.
- STOC-2004-ChenKLRSV #bound #confluence #theorem
- (Almost) tight bounds and existence theorems for confluent flows (JC, RDK, LL, RR, RS, AV), pp. 529–538.
- STOC-2003-ChenRS #algorithm #approximate #confluence
- Meet and merge: approximation algorithms for confluent flows (JC, RR, RS), pp. 373–382.
- ICALP-1997-KrumkeMNRRSW
- Improving Spanning Trees by Upgrading Nodes (SOK, MVM, HN, RR, SSR, RS, HCW), pp. 281–291.
- ICALP-1995-MaratheRSRRH #design #network #problem
- Bicriteria Network Design Problems (MVM, RR, RS, SSR, DJR, HBHI), pp. 487–498.