Eva Tardos
Eva Tardos
Professor of Computer Science, Cornell University
Adresse e-mail validée de - Page d'accueil
Citée par
Citée par
Maximizing the spread of influence through a social network
D Kempe, J Kleinberg, É Tardos
Proceedings of the ninth ACM SIGKDD international conference on Knowledge …, 2003
Algorithm design
J Kleinberg, E Tardos
Pearson Education India, 2006
How bad is selfish routing?
T Roughgarden, É Tardos
Journal of the ACM (JACM) 49 (2), 236-259, 2002
Influential nodes in a diffusion model for social networks
D Kempe, J Kleinberg, É Tardos
Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005
Approximation algorithms for scheduling unrelated parallel machines
JK Lenstra, DB Shmoys, É Tardos
Mathematical programming 46, 259-271, 1990
The price of stability for network design with fair cost allocation
E Anshelevich, A Dasgupta, J Kleinberg, É Tardos, T Wexler, ...
SIAM Journal on Computing 38 (4), 1602-1623, 2008
Approximation algorithms for facility location problems
DB Shmoys, É Tardos, K Aardal
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
An approximation algorithm for the generalized assignment problem
DB Shmoys, É Tardos
Mathematical programming 62 (1), 461-474, 1993
A constant-factor approximation algorithm for the k-median problem
M Charikar, S Guha, É Tardos, DB Shmoys
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
Fast approximation algorithms for fractional packing and covering problems
SA Plotkin, DB Shmoys, É Tardos
Mathematics of Operations Research 20 (2), 257-301, 1995
Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields
J Kleinberg, E Tardos
Journal of the ACM (JACM) 49 (5), 616-639, 2002
Truthful mechanisms for one-parameter agents
A Archer, É Tardos
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 482-491, 2001
A strongly polynomial algorithm to solve combinatorial linear programs
É Tardos
Operations Research 34 (2), 250-256, 1986
A strongly polynomial minimum cost circulation algorithm
É Tardos
Combinatorica 5 (3), 247-255, 1985
The quickest transshipment problem
B Hoppe, É Tardos
Mathematics of Operations Research 25 (1), 36-62, 2000
Bounding the inefficiency of equilibria in nonatomic congestion games
T Roughgarden, É Tardos
Games and economic behavior 47 (2), 389-403, 2004
An application of simultaneous diophantine approximation in combinatorial optimization
A Frank, É Tardos
Combinatorica 7, 49-65, 1987
Fast approximation algorithms for multicommodity flow problems
T Leighton, C Stein, F Makedon, É Tardos, S Plotkin, S Tragoudas
Proceedings of the twenty-third annual ACM symposium on Theory of Computing …, 1991
Improved approximation algorithms for network design problems
MX Goemans, AV Goldberg, S Plotkin, DB Shmoys, E Tardos, ...
Cornell University Operations Research and Industrial Engineering, 1995
An approximate truthful mechanism for combinatorial auctions with single parameter agents
A Archer, C Papadimitriou, K Talwar, É Tardos
Internet Mathematics 1 (2), 129-150, 2004
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20