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
[1]
Hilfe
Suche: Author="Guha, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Erratum to ''Approximation algorithms for connected dominating sets''
S. Guha
,
S. Khuller
Algorithmica
49
(1), 2007, pp. 79-79
Near-optimal sparse Fourier representations via sampling
A.C. Gilbert
,
S. Guha
,
P. Indyk
,
S. Muthukrishnan
,
M. Strauss
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 152-161
Approximating a finite metric by a small number of tree metrics
M. Charikar
,
C. Chekuri
,
A. Goel
,
S. Guha
,
S. Plotkin
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 379-388
Approximation algorithms for connected dominating sets
S. Guha
,
S. Khuller
Algorithmica
20
(4), 1998, pp. 374-387
Proximity problems for points on a rectilinear plane with rectangular obstacles
S. Guha
,
I. Suzuki
Algorithmica
17
, 1997, pp. 281-307