BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
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 DBLP: Raghavachari:Balaji

Contributed to:

ICALP 20042004
SAC 20042004
STOC 19981998
STOC 19951995
STOC 19941994

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.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.