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="Khuller, 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
Approximation algorithms with bounded performance guarantees for the clustered Traveling Salesman problem
N. Guttman-Beck
,
R. Hassin
,
S. Khuller
,
B. Raghavachari
Algorithmica
28
, 2000, pp. 422-437
Approximation algorithms for connected dominating sets
S. Guha
,
S. Khuller
Algorithmica
20
(4), 1998, pp. 374-387
Balancing minimum spanning trees and shortest-path trees
S. Khuller
,
B. Raghavachari
,
N. Young
Algorithmica
14
, 1995, pp. 305-321
Flow in planar graphs: A survey of recent results
S. Khuller
,
J. Naor
Technical Report (756), 1992, November
On-line algorithms for weighted bipartite matching and stable marriages
S. Khuller
,
S.G. Mitchell
,
V.V. Vazirani
Lecture Notes in Computer Science
510
, 1991, pp. 728-738
Processor efficient parallel algorithms for the two disjoint paths problem, and for finding a Kuratowski homeomorph
S. Khuller
,
S. Mitchell
,
V. Vazirani
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 300-305
Efficient parallel algorithms for testing connectivity and finding disjoint
s-t
paths in graphs
S. Khuller
,
B. Schieber
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 288-293