Algorithmic Modelling and Complexity (AMC)

LaTex template: scribe.tex.
Research assignment: Draft assignment of papers
Back to weekly schedule.

Schedule for scribes and research presentations (2003)

Week 36

• Tuesday 2 september - Scribe: Sander van der Schuyt.
• Thursday 4 september - Scribe: Munish Mahabiersing.

• Tuesday 9 september - Scribes: Kasper van den Berg, Shay Uzery.
• Thursday 11 september - Scribe: Bart de Boer.

• Tuesday 16 september - Scribe: Els Maes.
• Thursday 18 september - Scribe: Jurn Franken.

• Tuesday 23 september - Scribe: Martin van Es.
• Thursday 25 september - no class.
• Friday 26 september - Scribes: Rui Coelho, Paulo Magalhaes.

• Tuesday 30 september - Presentations : Bart de Boer, Els Maes.
• Tuesday 30 september - Scribe: Jules van Kempen.
• Thursday 2 october - Scribe: Sander van der Schuyt.

• Tuesday 7 october - Presentations : Kasper van den Berg, Shay Uzeri.
• Tuesday 7 october - Scribe: Munish Mahabiersing.
• Thursday 9 october - Scribe: Kasper van den Berg, Shay Uzeri.

• Tuesday 14 october - Presentations : Martin van Es, Jurn Franken.
• Tuesday 14 october - Scribe: Bart de Boer.
• Thursday 16 october - Scribe: Els Maes.

• Tuesday 21 october - Presentations : Rui Coelho, Paulo Magalhaes, Sander van der Schuyt.
• Tuesday 21 october - Scribe: Jurn Franken.
• Thursday 23 october - Scribe: Martin van Es.

• Tuesday 28 october - Presentations : Munish Mahabiersing.
• Tuesday 28 october - Scribes: Rui Coelho, Paulo Magalhaes.
• Thursday 30 october - Scribe: n.a.

• Tuesday November 4 - Tentamen
• Time: 9.00-12.00, in room BBL-160.
• The tentamen covers the topics treated in the lectures and is `open notes'.

In reserve

Assigned papers

• Kasper van den Berg
  N. Nisan, A. Ronen. Algorithmic mechanism design. Games and Economic Behavior 35 (2001) 166-196.
• Bart de Boer
  T. Kahveci, A. Singh. Map: Searching large genome databases. In: Pacific Symposium on Biocomputing, 8 (2003) 303-314 (see here).
• Rui Coelho
  J.M. Kleinberg. Authoritative sources in a hyperlinked environment, Journal of the ACM 46 (1999) 604-632.
• Martin van Es
  P. Caricato, G. Ghiani, A. Grieco, E. Guerriero. Parallel tabu search for a pickup and delivery problem under track contention. Parallel Computing 29:5 (2003) 631-639.
  (G. Ghiani, F. Guerriero, G. Laporte, R. Musmanno. Real-time vehicle routing: Solution concepts, algorithms and parallel computing concepts. Report, Center of Excellence for High Performance Computing, University of Calabria, 2003.)
• Jurn Franken
  G. Gambosi, A. Postiglione, M. Talamo. Algorithms for the relaxed online bin-packing model. SIAM J. Computing 30 (2000) 1532-1551.
• TBA
  B. Kalyanasundaram, J. Noga, K.R. Pruhs, and G.J. Woeginger. Caching for web searching, Algorithmica 33 (2002) 353-370.
• Els Maes
  Z. Bian. Wavelength assignment algorithms for WDM optical networks. MSc. Thesis, School of Computing Science, Simon Fraser University, August 2003, pp 1-23.
  (I. Caragiannis, Chr. Kaklamanis, P. Persiano. Wavelength routing in all-optical tree networks: a survey. Bulletin of the EATCS nr 76, Feb 2002, pp. 104-123.)
• Paulo Magalhaes
  M. Faloutsos, P. Faloutsos, Chr. Faloutsos. On powerlLaw relationships of the Internet topology. ACM SIGCOMM, 1999.
• Munish Mahabiersing
  R. Jain, A. Puri, R. Sengupta. Geographical routing using partial information for wireless ad-hoc networks. Techn. Memorandum UCB/ERL M99/69, University of California, Berkeley, 1999 (see here).
• Sander van der Schuyt
  S. Suri, T. Sandholm, P. Warkhede. Compressing two-dimensional routing tables. Algorithmica 35 (2003) 287-300.
• Shay Uzeri
  M. Dorigo, I.M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans. Evolutionary Comput. 1:1 (1997) 53-66.
  (M. Dorigo, I.M. Gambardella. Ant colonies for the traveling salesman problem. Techn. Report TR/IRIDIA 1996-3, Univ Libre de Bruxelles, 1996.)