Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Raghavachari, Balaji"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A 4/3-approximation algorithm for minimum 3-edge-connectivity
Prabhakar Gubbala
,
Balaji Raghavachari
Lecture Notes in Computer Science
4619
, 2007, pp. 39-51
Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem
Prabhakar Gubbala
,
Balaji Raghavachari
Lecture Notes in Computer Science
3509
, 2005, pp. 422-436
Survivable network design: The capacitated minimum spanning network problem
Raja Jothi
,
Balaji Raghavachari
Information Processing Letters
91
(4), 2004, pp. 183-190
Improved approximation algorithms for the single-sink buy-at-bulk network design problems
Raja Jothi
,
Balaji Raghavachari
Lecture Notes in Computer Science
3111
, 2004, pp. 336-348
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
Raja Jothi
,
Balaji Raghavachari
Lecture Notes in Computer Science
3142
, 2004, pp. 805-818
Approximation algorithms for finding low-degree subgraphs
Philip N. Klein
,
Radha Krishnan
,
Balaji Raghavachari
,
R. Ravi
Networks
44
(3), 2004, pp. 203-215
Algorithms for capacitated vehicle routing
Moses Charikar
,
Samir Khuller
,
Balaji Raghavachari
SIAM Journal on Computing
31
(3), 2001-2002, pp. 665-682
The directed minimum-degree spanning tree problem
Radha Krishnan
,
Balaji Raghavachari
Lecture Notes in Computer Science
2245
, 2001, pp. 232-243
A uniform framework for approximating weighted connectivity problems
Samir Khuller
,
Balaji Raghavachari
,
An Zhu
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 937-938
Basic graph algorithms
Samir Khuller
,
Balaji Raghavachari
Algorithms and Theory of Computation Handbook, 1999, pp. 6-1 - 6-23
Advanced combinatorial algorithms
Samir Khuller
,
Balaji Raghavachari
Algorithms and Theory of Computation Handbook, 1999, pp. 7-1 - 7-23
A 3/2-approximation algorithm for the mixed postman problem
Balaji Raghavachari
,
Jeyakesavan Veerasamy
SIAM Journal on Discrete Mathematics
12
(4), 1999, pp. 425-433
Approximation algorithms for the asymmetric Postman problem
Balaji Raghavachari
,
Jeyakesavan Veerasamy
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 734-741
Algorithms for capacitated vehicle routing
Moses Charikar
,
Samir Khuller
,
Balaji Raghavachari
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 349-358
The finite capacity dial-a-ride problem
Moses Charikar
,
Balaji Raghavachari
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 458-467
Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
Nili Guttmann-Beck
,
Refael Hassin
,
Samir Khuller
,
Balaji Raghavachari
Lecture Notes in Computer Science
1530
, 1998, pp. 6-17
Approximation algorithms for the mixed postman problem
Balaji Raghavachari
,
Jeyakesavan Veerasamy
Lecture Notes in Computer Science
1412
, 1998, pp. 169-179
A network-flow technique for finding low-weight bounded-degree spanning trees
Sándor P. Fekete
,
Samir Khuller
,
Monika Klemmstein
,
Balaji Raghavachari
,
Neal Young
Journal of Algorithms
24
(2), 1997, pp. 310-324
A network-flow technique for finding low-weight bounded-degree spanning trees
Sándor P. Fekete
,
Samir Khuller
,
Monika Klemmstein
,
Balaji Raghavachari
,
Neal Young
Lecture Notes in Computer Science
1084
, 1996, pp. 105-117
Parallel edge coloring approximation
Martin Fürer
,
Balaji Raghavachari
Parallel Processing Letters
6
(3), 1996, pp. 321-329
Landmarks in graphs
Samir Khuller
,
Balaji Raghavachari
,
Azriel Rosenfeld
Discrete Applied Mathematics
70
(2), 1996, pp. 217-229
On strongly connected digraphs with bounded cycle length
Samir Khuller
,
Balaji Raghavachari
,
Neal Young
Discrete Applied Mathematics
69
(3), 1996, pp. 281-289
Low-degree spanning trees of small weight
Samir Khuller
,
Balaji Raghavachari
,
Neal Young
SIAM Journal on Computing
25
(2), 1996, pp. 355-368
Improved approximation algorithms for uniform connectivity problems
Samir Khuller
,
Balaji Raghavachari
Journal of Algorithms
21
(2), 1996, pp. 434-450
An efficient parallel algorithm for finding Hamiltonian cycles in dense directed graphs
Martin Fürer
,
Balaji Raghavachari
Journal of Algorithms
18
(2), 1995, pp. 203-220
Seiten 1
2
>