In this section we prove Theorem REF .
We prove the APX-hardness of the two problems
Max-Adj\((\mbox{\footnotesize \textsl {weak}},\mbox{\footnotesize \textsl {weak}})\)  and Min-Brk\((\mbox{\footnotesize \textsl {weak}},\mbox{\footnotesize \textsl {weak}})\)  by two L-reductions (based on the same construction)
from the APX-hard problem E3-Occ-Max-E2-SAT [1]}, [2]}.
