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="Chaudhuri, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
Kamalika Chaudhuri
,
Satish Rao
,
Samantha Riesenfeld
,
Kunal Talwar
Theoretical Computer Science
410
(44), 2009, pp. 4489-4503
Computing mimicking networks
S. Chaudhuri
,
K.V. Subrahmanyam
,
F. Wagner
,
C.D. Zaroliagis
Algorithmica
26
(1), 2000, pp. 31-49
Shortest paths in digraphs of small treewidth - Part I: Sequential algorithms
S. Chaudhuri
,
C.D. Zaroliagis
Algorithmica
27
, 2000, pp. 212-226
Graph bisection algorithms with good average case behavior
T.N. Bui
,
S. Chaudhuri
,
F.T. Leighton
,
M. Sipser
Combinatorica
7
(2), 1987, pp. 171-192
Graph bisection algorithms with good average case behavior
T. Bui
,
S. Chaudhuri
,
T. Leighton
,
M. Sipser
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 181-192