Eva Tardos
Eva Tardos
Professor of Computer Science, Cornell University
Email verificata su cornell.edu - Home page
Titolo
Citata da
Citata da
Anno
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
75902003
Algorithm design
J Kleinberg, E Tardos
Pearson Education India, 2006
22602006
How bad is selfish routing?
T Roughgarden, É Tardos
Journal of the ACM (JACM) 49 (2), 236-259, 2002
22072002
Influential nodes in a diffusion model for social networks
D Kempe, J Kleinberg, É Tardos
International Colloquium on Automata, Languages, and Programming, 1127-1138, 2005
10822005
Approximation algorithms for scheduling unrelated parallel machines
JK Lenstra, DB Shmoys, É Tardos
Mathematical programming 46 (1-3), 259-271, 1990
10411990
The price of stability for network design with fair cost allocation
E Anshelevich, A Dasgupta, J Kleinberg, E Tardos, T Wexler, ...
SIAM Journal on Computing 38 (4), 1602-1623, 2008
9682008
Approximation algorithms for facility location problems
DB Shmoys, É Tardos, K Aardal
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
9361997
An approximation algorithm for the generalized assignment problem
DB Shmoys, É Tardos
Mathematical programming 62 (1-3), 461-474, 1993
7421993
A constant-factor approximation algorithm for the k-median problem
M Charikar, S Guha, É Tardos, DB Shmoys
Journal of Computer and System Sciences 65 (1), 129-149, 2002
6992002
Fast approximation algorithms for fractional packing and covering problems
SA Plotkin, DB Shmoys, É Tardos
Mathematics of Operations Research 20 (2), 257-301, 1995
6951995
Truthful mechanisms for one-parameter agents
A Archer, É Tardos
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 482-491, 2001
5832001
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
5622002
A strongly polynomial algorithm to solve combinatorial linear programs
E Tardos
Operations Research 34 (2), 250-256, 1986
5221986
A strongly polynomial minimum cost circulation algorithm
É Tardos
Combinatorica 5 (3), 247-255, 1985
4091985
The quickest transshipment problem
B Hoppe, É Tardos
Mathematics of Operations Research 25 (1), 36-62, 2000
3682000
Bounding the inefficiency of equilibria in nonatomic congestion games
T Roughgarden, É Tardos
Games and economic behavior 47 (2), 389-403, 2004
3392004
Fast approximation algorithms for multicommodity flow problems
T Leighton, F Makedon, S Plotkin, C Stein, E Tardos, S Tragoudas
Journal of Computer and System Sciences 50 (2), 228-243, 1995
3171995
Improved approximation algorithms for network design problems
DB Shmoys, E Tardos, DP Williamson
Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, 223, 1994
2911994
Frugal path mechanisms
A Archer, É Tardos
ACM Transactions on Algorithms (TALG) 3 (1), 1-22, 2007
2842007
Near-optimal network design with selfish agents
E Anshelevich, A Dasgupta, E Tardos, T Wexler
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
2782003
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20