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="Tardos, {\'{E}}va"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximating the smallest
k
-edge connected spanning subgraph by LP-rounding
Harold N. Gabow
,
Michel X. Goemans
,
Éva Tardos
,
David P. Williamson
Networks
53
(4), 2009, pp. 345-357
Algorithms for a network design problem with crossing supermodular demands
Vardges Melkonian
,
Éva Tardos
Networks
43
(4), 2004, pp. 256-265
A constant-factor approximation algorithm for the
k
-median problem
Moses Charikar
,
Sudipto Guha
,
Éva Tardos
,
David B. Shmoys
Journal of Computer and System Sciences
65
(1), 2002, pp. 129-149
Fairness in routing and load balancing
Jon Kleinberg
,
Yuval Rabani
,
Éva Tardos
Journal of Computer and System Sciences
63
(1), 2001, pp. 2-20
A constant factor approximation algorithm for a class of classification problems
Anupam Gupta
,
Éva Tardos
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 652-658
Allocating bandwidth for bursty connections
Jon Kleinberg
,
Yuval Rabani
,
Éva Tardos
SIAM Journal on Computing
30
(1), 2000, pp. 191-217
A constant-factor approximation algorithm for the
k
-median problem
Moses Charikar
,
Sudipto Guha
,
Éva Tardos
,
David B. Shmoys
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 1-10
Approximation algorithms for a directed network design problem
Vardges Melkonian
,
Éva Tardos
Lecture Notes in Computer Science
1610
, 1999, pp. 345-360
Approximations for the disjoint paths problem in high-diameter planar networks
Jon Kleinberg
,
Éva Tardos
Journal of Computer and System Sciences
57
(1), 1998, pp. 61-73
Simple generalized maximum flow algorithms
Éva Tardos
,
Kevin D. Wayne
Lecture Notes in Computer Science
1412
, 1998, pp. 310-324
Approximation algorithms for Steiner and directed multicuts
Philip N. Klein
,
Serge A. Plotkin
,
Satish Rao
,
Éva Tardos
Journal of Algorithms
22
(2), 1997, pp. 241-269
Allocating bandwidth for bursty connections
Jon Kleinberg
,
Yuval Rabani
,
Éva Tardos
Proceedings of the 29th Annual ACM Symposium on Theory of Computing, STOC'97 (El Paso, Texas, May 4-6, 1997)
, 1997, pp. 664-673
Approximation algorithms for facility location problems
David B. Shmoys
,
Éva Tardos
,
Karen Aardal
Proceedings of the 29th Annual ACM Symposium on Theory of Computing, STOC'97 (El Paso, Texas, May 4-6, 1997)
, 1997, pp. 265-274
Separating maximally violated comb inequalities in planar graphs
Lisa Fleischer
,
Éva Tardos
Lecture Notes in Computer Science
1084
, 1996, pp. 475-489
Distributed packet switching in arbitrary networks
Yuval Rabani
,
Éva Tardos
Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pennsylvania, May 22-24, 1996)
, 1996, pp. 366-375
The quickest transshipment problem
Bruce Hoppe
,
Éva Tardos
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 512-521
Disjoint paths in densely embedded graphs
Jon Kleinberg
,
Éva Tardos
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 52-61
Fast approximation algorithms for multicommodity flow problems
Tom Leighton
,
Fillia Makedon
,
Serge Plotkin
,
Clifford Stein
,
Éva Tardos
,
Spyros Tragoudas
Journal of Computer and System Sciences
50
(2), 1995, pp. 228-243
A faster parametric minimum-cut algorithm
Dan Gusfield
,
Éva Tardos
Algorithmica
11
, 1994, pp. 278-290