`Travelled to:`

1 × Canada

1 × Cyprus

1 × Finland

2 × USA

`Collaborated with:`

S.Khuller R.Jothi M.Charikar N.E.Young O.Daescu K.Saraç

`Talks about:`

algorithm (3) approxim (2) problem (2) capacit (2) tree (2) span (2) placement (1) multicast (1) suppress (1) variant (1)

## Person: Balaji Raghavachari

### DBLP: Raghavachari:Balaji

### Contributed to:

### Wrote 5 papers:

- ICALP-2004-JothiR #algorithm #approximate #design #network #problem
- Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design (RJ, BR), pp. 805–818.
- SAC-2004-DaescuJRS #deployment #multi #reliability
- Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case (OD, RJ, BR, KS), pp. 334–338.
- STOC-1998-CharikarKR #algorithm
- Algorithms for Capacitated Vehicle Routing (MC, SK, BR), pp. 349–358.
- STOC-1995-KhullerR #algorithm #approximate #problem
- Improved approximation algorithms for uniform connectivity problems (SK, BR), pp. 1–10.
- STOC-1994-KhullerRY
- Low degree spanning trees of small weight (SK, BR, NEY), pp. 412–421.