程序代写代做代考 graph Hotty problem

Hotty problem

f
cannotbe solvedin pole time
x

Given does G
ofsge
optimization version
at leasthe
agraphG andano contain an indep set
he decision version

11213 4,56,7 l
02 301μs
Given agraphG anda no K does G contain a vertex cover
ofsix
at mostk
decision versions
III optimization version
a

Mio
t UisinSandV
will have V
is not
and not U
VI
2 Visin VI
S andUas not will have U and not V
3 Neither V
IE will have both V V
nor V is in S
B Sypposythat V s is a vertex aver
i

vertex cover
if G ofsize
has
at mostn 1
indep
ifG has an setofsize atleastI

o_O
o

Ni 0 N2 l N3
f
n
n

Ex
Nivas a nTVr5 nCkzV N I Nz I s N3 l
K
O Rz0
X Azzo

Satisfiability
problem SAI
3SAI

n VHzVN3
Nz
N3
N Vaz Vaz n MTVNz VA4 n 54VANNI
I

Ni I
O
set ni toeither
ki
I

P NP
we don’tknow
if
NP
X EN P
YEp X problem in
and for all YENP Then X is the hardest
SAT has been proven to be
3
such aproblem
such aproblem
is called NP
complete

2 3
that be NP
Transitivity
2EpY and YSpx
if
then
X
3 SAT Spindepset Sp vertexCounspstarrer
2
Ep
Basic strategy toprove
a problem 1 Prove X E N P
X is
NP complete
Y to
Prove that Y
Choose aproblem known
p
is complete
X

Discussion 10
1. Given the SAT problem from lecture for a Boolean expression in Conjunctive Normal Form
with any number of clauses and any number of literals in each clause. For example, (X1 􏰕􏰖X3)􏰗(X1 􏰕􏰖X2 􏰕X4 􏰕X5)􏰗…
Prove that SAT is polynomial time reducible to the 3-SAT problem (in which each clause contains at most 3 literals.)
2. The Set Packing problem is as follows. We are given m sets S1, S2, … Sm and an integer k. Our goal is to select k of the m sets such that no selected pair have any elements in common. Prove that this problem is NP-complete.
3. The Steiner Tree problem is as follows. Given an undirected graph G=(V,E) with nonnegative edge costs and whose vertices are partitioned into two sets, R and S, find a tree T ⊆ G such that for every v in R, v is in T with total cost at most C. That is, the tree that contains every vertex in R (and possibly some in S) with a total edge cost of at most C.
Prove that this problem is NP-complete.

SAI m
Miraz
VMzVNz NiVNzVNsVN4
3SAT_
Miramar NivNzVNz
N1VNzVN3
N
TI
NiVRzVNzVN4VN5
Grim
p
NIVKH I
dnGIk4Vns 3SATSpSAT
awards
nGIZ3V

1
in NP length certificate
a
a setofsighofsetswhich
Show SetPacking is
Pol
fui
a
b Pol time
have
b check no ofsets k V
no Is
chede no sets are repeated
check intersections of all sets are null
in common

choose 3 Show
Indep set
2
N’D hand that are
NP
NAhard
set ofproblems
hard as
at leastas complete problems
L 2zSpstp

42
i
0
1,3

the SteinerTree Problem in NP
Choose vertex Cover
rtex Cover Epstein Tree
Shou
t
is
2 3

0
ciao
foralledges no
no
IineIma4arteEE G
Elmoin.gg vertexcoverofsjc te in