Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
1. Background
2. Vertex Cover Problem
3. Planar Graph Coloring Problem
4. Traveling-salesman Problem
5. Set Covering Problem
6. Application of Set Cover to Art Gallery problems
NP1.gif (GIF Image, 349x161 pixels) http://max.cs.kzoo.edu/~kschultz/CS5
“I can’t find an efficient algorithm, but neither can all these famous
people”.
At the very least, this would inform your boss that it would do no good
to fire you and hire another expert on algorithms.
Background
◮ [Instance] Graph G = (V , E ).
◮ [Feasible Solution] A subset C ⊆ V such that at least one
vertex of every edge of G belongs C .
◮ [Value] The value of the solution is the size of the cover |C |,
and the goal is to minimize it.
Greedy Algorithm I
a j
b f
g i
c
d
h
e
S1
S2
S6
S3 S4 S5
8 7 10 9
10 14 11
11 6 15
8
12
7
6
1 1
9 5 13 5
12 16
P P
2 2
3 4 3 4
16 14 13 4
1 15
3
4 16
15
17 P P 2
2 3
1
F4
F1
F2
F5 F6
F3