Presentation papers

The presentations are due on Nov. 7 (extended deadline)

1. Not available - assigned to Seyed M. Tabatabaei Yazdi A. Zelikovsky An 11/6-approximation algorithm for the network steiner problem

2. Not available - assigned to Elangovan KN Charikar et. al. Approximation Algorithms for Directed Steiner Problems

3. Not available - assigned Ajit Behera to L. Lewin-Eytan, J. Naor and A. Orda, Admission control in networks with advance reservations,
Algorithmica, Special Issue on approximation and online algorithms, Vol. 40 (2004), pp. 293-304.

4. R. Bar-Yehuda, K. Bendel, A. Freund, and D. Rawitz. Local Ratio: a unified framework for approximation algorithms.
ACM Computing Surveys 36(4):422-463, 2000 (topics not covered in class)

5. Not available - Assigned to Vinith Reddy A. Freund, and J. (S.) Naor. Approximating the advertisement placement problem.

6. Not available - assigned to Manish Singh A. Kumar, R. Rastogi, A. Silberschatz and B. Yener. Algorithms for provisioning VPNs in the hose model

7. Not available - assigned to Srinivas Jonnakuty D. Amzallag, J. Naor and D. Raz, Algorithmic aspects of access network design in B3G/4G cellular networks, Proceedings of the 26th Annual IEEE Infocom Conference, Anchorage, Alaska

8. Not available - assigned to Asad D. Xu, E. Anshelevich, and M. Chiang On Survivable Access Network Design: Complexity and Algorithms

9. G. Brightwell et al. Some strategies for reserving resilient capacity SIAM J. Discrete Math., , Vol. 14, No. 4, 524-539, 2001.

10. Not available - Assigned to Chandan R. S. Kumar, J. Turner, P. Crowley, M. Mitzenmacher. HEXA: Compact Data Structures for Faster Packet Processing.
Proceedings of IEEE ICNP'07.

11. C Chekuri Routing and Network Design with Robustness to Changing or Uncertain Traffic Demands
A survey in SIGACT News, 38(3): 106--128, September 2007.

12. Not available - assigned to Gautam Roy Chekuri et al. Buy-at-Bulk Network Design with Protection

13. Not available - reserved to Navid Lau, S. Naor, M.R. Salavatipour, and M. Singh, Survivable Network Design with Degree or Order Constraints

14. Not available - assigned to Harshavardhan Chenji Uriel Feige On allocations that maximize fairness

15. "Minimizing Service and Operation Costs of Periodic Scheduling"
Amotz Bar-Noy, Randeep Bhatia, Joseph (Seffi) Naor, and Baruch Schieber

16 Polynomial-Time Approximation Scheme for Data Broadcast, Claire Kenyon, Nicolas Schabanel et Neal E. Young. Thirty-Second Annual ACM Symposium on Theory of Computing (STOC), 659-666, 2000.