Kloumann, L. Adamic, J. Kleinberg, S. The Lifecycles of Apps in a Social Ecosystem. Cheng, L.
|Published (Last):||7 August 2006|
|PDF File Size:||3.44 Mb|
|ePub File Size:||4.51 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.