2011
2010
2009
2008
2007
2006
2005
2004
Approximation algorithms for finding low-degree subgraphs,
P. N. Klein, R. Krishnan, B. Raghavachari, and R. Ravi,
Networks, Volume 44, Number 3, pages 203-215, 2004.
Load-Balanced for reliable multicast,
C. Gong, O. Daescu, R. Jothi, B. Raghavachari, and K. Sarac,
in Proc. 3rd IASTED Intl. Conference on Communications, Internet, and Information Technology (CIIT), US Virgin Islands, Nov 22-24, 2004.
Protein folding in hydrophobic-hydrophilic model: How good is theory in practice?
R. Jothi and B. Raghavachari,
Poster Presentation at the 7th Annual Conference on Computational Genomics (CG), Reston, VA, Oct 21-24, 2004.
Degree-bounded minimum spanning trees,
R. Jothi and B. Raghavachari,
in Proc. 16th Canadian Conference on Computational Geometry (CCCG),
pp. 192-195, Montreal, Canada, Aug 9-11, 2004.
Approximation algorithms for the capacitated minimum spanning tree
problem and its variants in network design,
R. Jothi and B. Raghavachari,
in Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP),
pp. 805-818, Springer-Verlag LNCS 3142, Turku, Finland, July 12-16, 2004.
Improved
approximation algorithms for the single-sink buy-at-bulk network design problems,
R. Jothi and B. Raghavachari,
in Proc. 9th Scandinavian Workshop on Algorithm Theory (SWAT),
pp. 336-348, Springer-Verlag LNCS 3111, Humlebaek, Denmark, July 8-10, 2004.
Dynamic
Dual-homing protection in WDM mesh networks,
V. Vokkarane, J. Wang, R. Jothi, X. Qi, B. Raghavachari, and J. Jue
in Proc. IEEE International Conference on Communications (ICC),
Vol. 3, pp. 1644-1648, Paris, France, June 20-24, 2004.
Minimum latency tours and the k-traveling repairman problem,
R. Jothi and B. Raghavachari,
in Proc. Latin American Theoretical INformatics (LATIN),
Springer-Verlag LNCS 2976, pp. 423-433, Buenos Aires, Argentina, April 4-9, 2004.
Finding k-Connected subgraphs with minimum average weight,
P. Gubbala and B. Raghavachari,
in Proc. Latin American Theoretical INformatics (LATIN),
Springer-Verlag LNCS 2976, pp. 212-221, Buenos Aires, Argentina, April 4-9, 2004.
Optimal placement of NAK suppressing agents for reliable
multicast: a partial deployment case,
O. Daescu, R. Jothi, B. Raghavachari, and K. Sarac
in Proc. 19th ACM Symposium on Applied Computing (SAC),
Nicosia, Cyprus, March 14-17, pp. 334-338, 2004.
Survivable
network design: the capacitated minimum spanning network problem,
R. Jothi
and B. Raghavachari
in Proc. 7th INFORMS Telecommunications Conference (Telecom),
Boca Raton, Florida, March 7-10, pp. 50-52, 2004.
Journal version of this paper appeared in
Information Processing Letters, Vol. 91(4), pp. 183-190, 2004.
Multi-homing protection in WDM mesh networks,
K. Deen, R. Jothi and B. Raghavachari
in Proc. 7th INFORMS Telecommunications Conference (Telecom),
Boca Raton, Florida, March 7-10, 2004.
Revisiting
Esau-Williams' algorithm: on the design of local access networks,
R. Jothi and B. Raghavachari
in Proc. 7th INFORMS Telecommunications Conference (Telecom),
Boca Raton, Florida, March 7-10, pp. 104-107, 2004.
Placement of proxy servers to support server-based reliable
multicast,
R. Jothi and B. Raghavachari,
in Proc. 3rd IEEE International Conference on Networking (ICN),
ISBN 0-86341-326-9, French Caribbean, Feb 29-Mar 4, 2004.
Dynamic capacitated minimum spanning trees,
R. Jothi and B. Raghavachari
in Proc. 3rd IEEE International Conference on Networking (ICN),
ISBN 0-86341-326-9, French Caribbean, Feb 29-Mar 4, 2004.
2003
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
This page was last updated in September 2011.
Return to Balaji Raghavachari's home page.