On-line and Approximation Algorithms - 0368.4041

-----

Yossi Azar ( azar@tau.ac.il )
2nd Semester, 2005/6 - Mon 10-13, Merkazei-Al 315
School of Computer Science,
Tel-Aviv University

-----

This page will be modified during the course, and will outline the classes.
For the outline of the course given in 2004/5 see course2004/5

Text books:

(1) Online computation and Competitive Analysis, A Borodin and R. El-Yaniv, Cambridge university press, 1998.
(2) Approximation Algorithms for NP-hard problems, edited by S. Hochbaum, PWS Publishing company, 1997.
(3) Online Algorithms - The State of the Art, edited by A. Fiat and G. Woeginger, Springer, 1998.
(4) Papers published in the last 15 years.
(5) Lecture notes from Berkeley 97 Yair Bartal
(6) Lecture notes from Brics 96 Susanne Albers

Course syllabus:

Online algorithms (algorithms that do not have all the information/input in advance) and some corresponding approximation algorithms.

Course outline

  1. Mar 6, 2006 :
    Introduction
    Examples of on-line problems
    Competitive ratio
    Ski rental problem - 2 upper/lower bounds
    Path searching problem - 9 upper/lower bounds
    Machines Scheduling - 2 competitive
  2. Mar 13, 2006 :
    List update - 2 competitive MF algorithm
    List update - 2 lower bound
  3. Mar 20, 2006 :
    Paging - k competitive LRU/FIFO
    Paging - k lower bound
    k-server - k general lower bound
    k-server on the line - k competitive Double Cover algorithm
  4. Mar 27, 2006 :
    Randomized algorithms
    Ski rental - randomized upper/lower bounds
    Paging - 2H(k) competitive randomized marking algorithm
  5. Apr 3, 2006 :
    Paging - H(k) randomized lower bound
    Relations between different adversaries
    Load balancing - identical machines
  6. Apr 24, 2006 :
    Load balancing - related machines
    Load balancing - restricted assignment - deterministic and randomized lower bound
    Load balancing - restricted assignment - upper bound
  7. May 1, 2006 :
    Load balancing - unrelated machines
    Virtual circuit routing
  8. May 8, 2006 :
    Virtual circuit routing
    Lower bounds for virtual circuit routing
    Virtual circuit routing with durations
  9. May 15, 2006 :
    Virtual circuit routing with durations
    Benefit problems - financial problems - upper/lower bounds
    Admission control and routing - general graphs
  10. May 22, 2006 :
    Admission control and routing - general graphs
    Admission control on the line - lower bounds
    Admission control on the line - small bandwidth requirement
    Admission control on the line - classify & select
  11. May 29, 2006:
    Admission control on the line - various models
  12. Jun 5, 2006:
    Scheduling problems - maximum completion time identical machines
    Scheduling problems - reduction to batch
    Scheduling problems -response time (flow time) SPT & SRPT
  13. Jun 12, 2006:
    Exam
Last updated May 14, 2006