In what follows I use HS, GJ, AHU(DS), etc. These refer to the books listed in the class WEB page (first handout). I also make reference to A.# and these refer to some papers which I will put in the GSL (top of the mailboxes). As poited out below, some of those papers are available digitally through this page. You may borrow them and copy them as LONG AS IT IS FOR A SHORT PERIOD OF TIME. TRY NOT TO TAKE THEM FOR MORE THAN 5 - 10 MINUTES. Note that in the slides I have expanded on the material in the papers. Also, the notation is not always the same in the slides and the papers (it is better in the slides).
A-1 -- A-7: Operating Systems Theory, Coffman and Denning, Prentice Hall (197?)
A-28 -- A-35: T. Gonzalez, Clustering to Minimize the Minimum intercluster distance, Theorectical Computer Science, 38, pp 293 - 306, 1985
A-51 -- A-59: Flows in Networks, Ford and Fulkerson, Priceton Press (196?)
A-60 -- A-68: Self-Adjusting Heaps, SIAM J. Comput., Vol 15 #1, Feb. 1986.
A-87 -- A-96: (from [H])
SLIDES.INTRO: The material in the slides was partially derived from the following sources:
I.1 - I-8 : [AHU(DS): 16 - 30], [HS: 24 - 32], O notation is from HS
I.9 - I.15: [GJ: 2 - 15]
SLIDES.APPROX: The material in the slides was partially derived from the following sources:
III.0 - III.3: [HS 559 -562]
III.4 - III.7: [A.16 and A.17]
III.8 - III.22: [A.1 - A.7]
III.23 - III.34: [A.25 - A.27]
III.35 - III.44: [A.19 - A.24]
III.45 - III.48: [A.29 - A.30]
III.49 - III.53: [A.8 - A.15]
III.54 - III.55: [A.34]
III.56 - III.59: [GJ 146]
III.60 - III-69: [HS 585 - 596]
III.70 - III.72: [GJ 140 -141]
III-73 - III-75: [HS 578 - 580]
SLIDES.APPROX2: The material in the slides was partially derived from the following sources:
IV-0 - IV-27: [A.36 - A.50] The proof of approximation bound for the D&C algorithm was not discussed in detail.
SLIDES.NP: The material in the slides was partially derived from the following sources:
I.16 - I.39: [GJ: 17 - 44] I.16 - I.39 wes not covered, but we defined polynomial transformations and SAT and 3SAT.
I.40 - I.42: [GJ: 48 - 50]
SLIDES.NP2: The material in the slides was partially derived from the following sources:
II.0 - II.5 : ----
II.6 - II.26 and II.34 - II.37: [GJ 50 - 60]
II.27 - II.33: ----
II.38 - II.56: [GJ 60 - 71]
II.57 - II.61 and II.65 : [GJ 72 - 76] II.57-59 was not covered
II.62 - II.64: [Information Processing Letters, #2, 91 - 95, 1973]
II.66 - II.69: [GJ 109 - 115]
II.70 - II.74: [GJ 90 - 96 and 102 - 103]
SLIDES.MAXFLOW: The material in the slides is from the following sources:
All of this material is from A.51 - A.59
SLIDES.DSALG:
V.0 - V.14 Paper (From A.60-A.68) "Self Adjusting Heaps". This was discussed in detail).
V.15 - V.46 Paper (A.69-A.86) "Fibonacci Heaps and their uses ..." (The new Min Cost Spanning trees algorithm will be discussed in detail, but Fibonacci heaps will not discussed in detail).
SLIDES.MISC
H.1 - H.9 Randomized Algorithms (A.87 - A.95)
L.1 - L.5 Lower Bounds, Min and Max Gaps (A.96)