S Sz
A CC G G T C G CC AG G T G G C
EE’t
minutes
3 gaps
SEASIDE DISEASE
O
Say M is either
an opt solution XmYn EM or
0PTCi j as theminarty
between
ay ay
Define
an
fx Y
X
Xm LY Yul
alignment
XmYn M
I
0 0
i
i
Alignment Initialize
for I for
I
it to M
re gqq
xY iseach Afc o for i
ACOI js n e j ton
formula Takes 0 inn
x
me t.fi
er N
ftp.ff
H
I
74IfE 1EiYE
9
F
f
f
Eff
Cmn 42cm n
44cm man li
2Cmn_M
0
mn
A Ai Az Az
An
50 20
BCD Bis C
D
10,400 3,000
10
B CD BCD
DID
total
k op’s
Mn
k
2
10 50
Ai AHA
OPTCeij opt art ofmultiplying matrices I though I
one it EE mi kEEfY valveoftheopt sol
E
AI
t
n
k
for
i0
endfor for je2
to n
j I fo t by I
it OPTC i
for i
to n
Takes
0
TETE
n3
iF
t
Z s
y
2fDII 1
1
If there
G has
no negativecycles then shortest path from to
omit
is a
that is single and hence has at
I OP Tei v denotes the main costof
most n 1 edges
a v t path using at most a edges we want to find OPECn l s
v
II
OPTCi v Min
Cvw OPT i l
t
w
Rec OpTic
formula
v
Min
Min Cvw
OPT Et v OPTCEI w
i
EI
to
omit
Is
I
SOCnn 0cm n
s
Is
i
i
pf
4
it
D
Ail
Bellomont ¦Ì Ocmn
Dijkstra’s Olmign
CPU
cost cost
fastest
I slowest
I
Cort
O Comm
0
Hint fat height
hi Firfidth wi
2 2X3
5
Depth
5
can say we have 32
Hint 2
Sortboxes in orderof decreasing bare area
Hcj Hei
heightofthe talleststack ofboxes I j
we
02
dies
12 32
Max Hci i YEY.fha.it
iwdu3woifJJ
Ali 3
It 2 3 Hb 26.5
Hgh stack
at the
ofboxes
top ofthestack
heightof the
tallest
I
j
WII
D
2.5
n
s formula
E
dj t
for
endfor Takes
it to use rec
n
itm
Cdi
0
Tour m2
Discussion 7
1. When their respective sport is not in season, USC’s student-athletes are very involved in their community, helping people and spreading goodwill for the school. Unfortunately, NCAA regulations limit each student-athlete to at most one community service project per semester, so the athletic department is not always able to help every deserving charity. For the upcoming semester, we have S student-athletes who want to volunteer their time, and B buses to help get them between campus and the location of their volunteering. There are F projects under consideration; project i requires si student- athletes and bi buses to accomplish, and will generate gi > 0 units of goodwill for the university. Our goal is to maximize the goodwill generated for the university subject to these constraints. Note that each project must be undertaken entirely or not done at all — we cannot choose, for example, to do half of project i to get half of gi goodwill.
2. Suppose you are organizing a company party. The corporation has a hierarchical ranking structure; that is, the CEO is the root node of the hierarchy tree, and the CEO’s immediate subordinates are the children of the root node, and so on in this fashion. To keep the party fun for all involved, you will not invite any employee whose immediate superior is invited. Each employee j has a value vj (a positive integer), representing how enjoyable their presence would be at the party. Our goal is to determine which employees to invite, subject to these constraints, to maximize the total value of invitees.
3. You are given a set of n types of rectangular 3-D boxes, where the ith box has height h(i), width w(i) and depth d(i) (all real numbers). You want to create a stack of boxes which is as tall as possible, but you can only stack a box on top of another box if the dimensions of the 2-D base of the lower box are each strictly larger than those of the 2-D base of
the higher box. Of course, you can rotate a box so that any side functions as its base. It is also allowable to use multiple instances of the same type of box.
I
o opt
1 knapsack
iB OPT eis B
qWf Sol
inv
opt valuedso I wi ng’s I i
cap of W
for projects e i with Sstudents B bases
Max Gi OPT i l S optcis.s.BY
si
Takes tahqggpf.ggeps to find
0
Bts