-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.html
More file actions
177 lines (158 loc) · 6.52 KB
/
index.html
File metadata and controls
177 lines (158 loc) · 6.52 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<title>Applied Algorithms@PKU</title>
<style>
table { border-collapse: collapse; }
td,th { vertical-align: top; text-align: left; padding: 0.5ex 0.5em; }
.odd { background-color: #dddddd; }
</style>
<script type="text/javascript">
var _gaq = _gaq || [];
_gaq.push(['_setAccount', 'UA-19406470-3']);
_gaq.push(['_trackPageview']);
(function() {
var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true;
ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js';
var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s);
})();
</script>
</head>
<body>
<!--
<div style="float: right;">
<a href="poster.pdf"><img src="poster.png"></a>
</div>
-->
<h1>Applied Algorithms@PKU</h1>
<h2>Prof. <a href="http://www.faculty.idc.ac.il/tami/">Tami Tamir</a>
TA: Muge Chen</h2>
<hr>
<font size="+1">[Home] [<a href="lectures.html">Lectures</a>]
[<a href="hmwk.html">Assignments</a>]
[<a href="supple.html">Supplementary Material</a>]
</font>
</font>
<hr>
<p>
The goal of this course is to help you become better prepared to tackle algorithm design for
"real-world" problems. This includes (1) being familiar with fundamental resource-allocation
problems and solutions, (2) understanding algorithmic techniques and the tradeoffs involved in
designing correct, efficient, and implementable algorithms, (3) understanding challenges in
algorithm design for selfish users, and (4) knowing how to model and abstract messy real- world
problems into clean problems that can be attacked using known paradigms or specific
algorithms.
</p>
<p>Hopefully, you will gain a greater appreciation of the beauty and elegance of
algorithms as well as where they are used in the real world. Specifically, we will study problems
arising in production planning, operating systems, media-on-demand systems, networks, and
more. This is the tentative list of topics :</p>
<table>
<tr class="odd">
<th> Introduction and Review: Graphs, Complexity classes.
<td>
<tr>
<th> Stable matching
<td>
<tr class="odd">
<th> Scheduling Theory.
<td>
<tr>
<th> Facility Location
<td>
<tr class="odd">
<th> Packing Problems
<td>
<tr>
<th> Algorithmic Game Theory
<td>
</table>
<h2>Specifics</h2>
<ul>
<li><b>Lecture time:</b> every weekday from 7/3 to 7/14 8-11:00</li>
<li><b>First lecture:</b> <i>Monday, July 3, 2017</i></li>
<li><b>Lecture room:</b> 2nd Teaching Building, 423</li>
<li><b>Contact:</b> Email
<code>chenmuge#at#pku.edu.cn</code></li>
</ul>
<!--
<p>Assuming there is interest, there will be an optional problem
solving session, in which we will discuss and try to solve
current open problems.</p>
-->
<h2>Prerequisites</h2>
<p>undergrad course in algorithms, data structures.</p>
<h2>Grading</h2>
<p>
3 homework assignments: 30%, final exam: 70%
</p>
<h2>Schedule</p>
<table>
<TR>
<TD> Date</TD>
<TD>Topic</TD>
<TD>Hours</TD>
</TR>
<TR class="odd">
<TD>July. 3</TD>
<TD>Introduction</A></TD>
<TD>3</TD>
</TR>
<TR>
<TD>July. 4</TD>
<TD>Stable matching + Scheduling Theory (1)</A></TD>
<TD>3</TD>
</TR>
<TR class="odd">
<TD>July. 5</TD>
<TD>Scheduling Theory (2)
+<i>Homework 1</i></A></TD>
<TD>3</TD>
</TR>
<TR>
<TD>July. 6</TD>
<TD>Scheduling + Facility Location(1)
</A></TD>
<TD>3</TD>
</TR>
<TR class="odd">
<TD>July. 7</TD>
<TD>Facility Location(2)</A></TD>
<TD>3</TD>
</TR>
<TR>
<TD>July. 10</TD>
<TD>Packing Problems+
<i>Homework 2</i></A></TD>
<TD>3</TD>
</TR>
<TR class="odd">
<TD>July. 11</TD>
<TD>Algorithmic Game Theory (1)</A></TD>
<TD>3</TD>
</TR>
<TR>
<TD>July. 12</TD>
<TD>Algorithmic Game Theory (2)</TD>
<TD>3</TD>
</TR>
<TR class="odd">
<TD> July. 13</TD>
<TD>Algorithmic Game Theory (3)+<i>Homework 3
</i></TD>
<TD>3</TD>
</TR>
<TR>
<TD> July. 14</TD>
<TD>Summary</TD>
<TD>3</TD>
</TR>
<TR>
<TD> July. 15</TD>
<TD>Final Exam</TD>
<TD>2</TD>
<TD> <a href="Final exam solution.pdf"> solutions<a> </TD>
</TR>
</table>
</body>
</html>