She is a theoretical computer scientist working on algorithms and game theory. She is most known for her work on network-flow algorithms, approximation algorithms, and quantifying the efficiency of selfish routing. Tardos was born in Budapest, Hungary in Research Interests I am a theoretical computer scientist working on algorithms, game theory, and networks. In recent years, I have focused on the interface of algorithms and game theory. With the emergence of large and complex networks such as the Web or the Internet there is increasing need to analyze and design systems used by diverse and self-interested set of users.
|Published (Last):||14 September 2010|
|PDF File Size:||18.22 Mb|
|ePub File Size:||3.97 Mb|
|Price:||Free* [*Free Regsitration Required]|
Kleinberg, Y. Rabani, and E. Kleinberg and E. Rabani and E. Scheduling D. Shmoys and E. Tardos, An approximation algorithm for the generalized assignment problem. Mathematical Programming A 62, , Goel, M. Henzinger, S. Plotkin, and E. Generalized Flow A. Goldberg, S. Plotkin, E. Tardos and K.
Simple Generalized Maximum Flow Algorithms. Packing and Covering Algorithms P. Klein, S. Plotkin, C. Stein and E. Tardos, Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. Leighton, F. Makedon, S. Stein, E. Tardos, S. Plotkin, D. Shmoys, and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, to appear in Mathematics of Operations Research.
Networks with transit times B. Hoppe and E. Fleischer and E. Operations Research Letters 23 pp. Effective bandwidth J. Allocating Bandwidth for Bursty Connection. Finding cuts in graphs S. Plotkin and E. Plotkin, S. Rao and E. Zoya Svitkina, and Eva Tardos. Min-Max Multiway Cut. Separating cutting planes L.
Other Miscellaneous papers.
National Academy of Sciences
Kleinberg, Y. Rabani, and E. Kleinberg and E. Rabani and E.
Algorithm Design ( 1st Edition) By Jon Kleinberg And Eva Tardos 2005 PDF
ALGORITHMS EVA TARDOS PDF