LYCILM OI ALABANG

No. 88 GNT BIdg., NuLIonuI Roud, PuLuLun, MunLInIupu CILv

COLLEGE OF COMPUTER STUDIES

I. COURSE IDENTIFICATION
Course Title Free Elective 3 (Advanced Algorithm)
Course Credit 3 units
Course Prerequisite Data structures and algorithm design, Introduction to algorithms, PPL
Course Corequisite None
Course Description This course introduces students the advance techniques in algorithmic
design, analysis and algorithmic strategies.

II. COURSE OB1ECTIVES
General Obiectives The maior obiective oI oI this course is to enable students
knowledgeable and proIicient in advanced algorithm design, analysis
and strategies. Topics involve:
Network Ilows (max Ilow and min-cost Ilow/circulation)
Data structures (Iibonacci heaps, splay trees, dynamic trees)
Linear programming (structural results, algorithms)
Dealing with intractability: approximation algorithms
(techniques Ior design and analysis)
Dealing with large data sets (compression, streaming algorithms,
compressed sensing)
Computational geometry

III. TEXTBOOK(S) AND REFERENCES
ReIerences

















Online ReIerence
Thomas Back, David Fogel, et al., Evolutionarv Computation 2.
Advanced Algorithm and Operators, IOP Publishing Ltd., 2000

A. Borodin and R. El-Yaniv, Online Computation and Competitive
Analvsis, Cambridge Univ. Press, 1998.

A. Fiat and G. Woeginger, eds., Online Algorithms. The State of the Art
(LNCS 1442), Springer-Verlag, 1998.

D.S. Hochbaum, ed., Approximation Algorithms for NP-Complete
Problems, PWS, 1997.

R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge
Univ. Press, 1995.

C.H. Papadimitriou, Computational Complexitv, Addison-Wesley, 1994.

http://ocw.mit.edu/courses/electrical-engineering-and-computer-
science/6-854i-advanced-algorithms-Iall-2008/lecture-notes/

IV. COURSE OUTLINE
Week Modules/Topics Hours
LYCILM OI ALABANG
No. 88 GNT BIdg., NuLIonuI Roud, PuLuLun, MunLInIupu CILv

COLLEGE OF COMPUTER STUDIES

1






To




3
Prelim Topic:
O Fibonacci heaps
O Networks Ilows
O Maximum Ilow, minimum cost circulation
O Golden-Tarian min-cost circulation algorithm
O Cancel-and-tighten algorithm; binary search trees
O Splay trees
O Dynamic trees (part 1 and 2)
O Linear programming (LP)

Quick Review
Written Exercises
Programming Exercises








19.5
Preliminary Examination 3
5

to


8
Midterm Topics
O LP: duality, geometry, simplex
O LP: complexity, introduction to the ellipsoid algorithms
O LP: ellipsoid algorithm
O LP: applications oI the ellipsoid algorithm
O Conic programming 1 and 2
O Approximation algorithms (Iacility location, max-cut)
O Max-cut and sparsest-cut
O Multi-commodity Ilows and metric embeddings
O Convex hulls
O Convex hulls and Iixed dimension LP

Quick Review
Written exercises
Programming exercises





19.5
Midterm Examination 3

10



To



14
PreIinal Topics:
O Voronoi diagrams
O Approximation scheme Ior the Euclidean traveling salesman problem
O Streaming algorithms
O Deterministic List Accessing
Algorithms MTF, Transpose
Amortized Analysis
List Factoring
Phase Partitioning and TIMESTAMP algorithm
O Randomized List Accessing
BIT algorithm
Random MTF
COMB algorithm
O Deterministic Paging
Optimal oIIline
Marking and conservative paging
10.5
LYCILM OI ALABANG
No. 88 GNT BIdg., NuLIonuI Roud, PuLuLun, MunLInIupu CILv

COLLEGE OF COMPUTER STUDIES

O Randomized Paging
Adversaries and their relative power
RANDOM paging
MARK paging
O Access graphs and uniIorm competitiveness

Quick review
Written Exercises
Programming exercises
Prefinal Examination 3
16

To

17
Final Topics
O Bipartitite Matching
RANDOM algorithm
RANKING algorithm
EARLY algorithm
O Metrical Task Systems
Transitions cost vs. processing cost in MTSs
Traversal algorithm
Optimal MTS algorithm based on work Iunction
Randomized MTS algorithm Ior unit state-transition cost
O K-server problem
OIIline approaches
Practical special cases
K-server coniecture
Line and tree metrics
Competitiveness oI work Iunction algorithm
O Game theory
Abstractions
Randomized strategies
O Reuqest-answer games
O ero-sum games
Yao`s principle
O Randomized approaches to K-server
Circle as metric space
Cat and rat game on graphs
HARMONIC algorithm
Graphs
Arbitrary metric spaces

Quick Review
Written exercises
Programming exercises

Final Project/Presentation (System with an embedded or integrated algorithmic
applications)



19.5
Final Examination 3
Total Number of Hours 90

LYCILM OI ALABANG
No. 88 GNT BIdg., NuLIonuI Roud, PuLuLun, MunLInIupu CILv

COLLEGE OF COMPUTER STUDIES

V. INSTRUCTOR AND SCHEDULE INFORMATION
Name: ProI. Rodrigo P. Calapan, MIT

OIIice: 632 4038348 loc . 115
Home: 63 (optional)
Mobile Number: 639228405270 / 09165777451
Email: rodrigocalapan2000(yahoo.com

Consultation Hours:

Meeting Place and Time:

SY: 2009-2010 Term: 1
st
semester

Room:
Day and Time:

VI. VERSION
Version 2.0
ModiIied on June 20, 2011
By: Rodrigo P. Calapan