On-line and Approximation Algorithms - 0368.4041

-----

Yossi Azar ( azar@tau.ac.il )
1st Semester, 2009/10 - Mon 15-18, Orenstein 102
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 2005/6 see course2005/6

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 25 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. Oct 19, 2009 :
    Introduction
    Examples of approximations algorithms
    2 approximation for vertex cover
    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. Oct 26, 2009 :
    List update - definitions
    List update - various algorithms
    List update -2 competitive MF algorithm
    List update - 2 lower bound
  3. Nov 2, 2009 :
    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. Nov 9, 2009 :
    Randomized algorithms
    Quick sort, primality test, max cut
    Ski rental - randomized upper/lower bounds
    Survival game
    Paging - 2H(k) competitive randomized marking algorithm
  5. Nov 16, 2009 :
    Paging - H(k) randomized lower bound
    Oblivious, adaptive on-line and off-line adversaries
    Relation between the adversaries
    Load balancing - identical machines
  6. Nov 23, 2009 :
    Load balancing - related machines
    Load balancing - restricted assignment - deterministic and randomized lower bound
    Load balancing - restricted assignment - upper bound
  7. Nov 30, 2009 :
    Load balancing - unrelated machines
    Virtual circuit routing
    Lower bounds for virtual circuit routing
  8. Dec 7, 2009 :
    Benefit problems - financial problems - upper/lower bounds
    Admission control and routing - general graphs
    Admission control on the line - lower bounds
  9. Dec 14, 2009 :
    Admission control on the line - small bandwidth requirement
    Admission control on the line - classify & randomly select
    Admission control on the line - preemptive algorithms
  10. Dec 21, 2009 :
    Sixteen variants of admission control on the line:
    Determinstic vs. randomized
    Non-preemptive vs. preemptive
    Value =1 vs. value = length
    Ordered vs. general sequences
  11. Dec 28, 2009 :
    Scheduling problems - maximum completion time identical machines
    Scheduling problems - reduction to batch
    Response time (flow time) no release times - SPT
    Response time (flow time) with release times - SRPT
  12. Jan 4, 2010:
    EDF for unit size unit value jobs
    EDF for jobs of different size
    Max value first for unit size jobs with aribtrary value
    Bounded buffer - premptive non-fifo
    Bounded buffer - premptive fifo
  13. Jan 11, 2010:
    Bounded buffer - non-premptive non-fifo
    Bounded buffer - non-premptive fifo
    Picking the winner
  14. Jan 25 , 2010 at 9AM:
    Exam
Last updated Jan 11, 2010