单选题：Which one of the following statements is FALSE?
Which one of the following statements is FALSE? @[D](3)
A. SAT, Vertex Cover, Hamiltonian Cycle, Clique, Knapsack, Bin Packing, and Domination Set problems are all NP-completeness problems.
B. If there is a polynomial time $$(1+\frac{1}{2n})$$-approximation algorithm for Vertex Cover with $$n$$ being the total number of vertices in the graph, then P=NP.
C. If there is a polynomial time 3/2-approximation algorithm for K-Center, then P=NP.
D. Given a weighted directed acyclic graph (DAG) $$G$$ and a source vertex $$s$$ in $$G$$, it is NP-hard to find the longest distances from $$s$$ to all other vertices in $$G$$.
A.SAT, Vertex Cover, Hamiltonian Cycle, Clique, Knapsack, Bin Packing, and Domination Set problems are all NP-completeness problems.
B.If there is a polynomial time $$(1+\frac{1}{2n})$$-approximation algorithm for Vertex Cover with $$n$$ being the total number of vertices in the graph, then P=NP.
C.If there is a polynomial time 3/2-approximation algorithm for K-Center, then P=NP.
D.Given a weighted directed acyclic graph (DAG) $$G$$ and a source vertex $$s$$ in $$G$$, it is NP-hard to find the longest distances from $$s$$ to all other vertices in $$G$$.
答案：D
A. SAT, Vertex Cover, Hamiltonian Cycle, Clique, Knapsack, Bin Packing, and Domination Set problems are all NP-completeness problems.
B. If there is a polynomial time $$(1+\frac{1}{2n})$$-approximation algorithm for Vertex Cover with $$n$$ being the total number of vertices in the graph, then P=NP.
C. If there is a polynomial time 3/2-approximation algorithm for K-Center, then P=NP.
D. Given a weighted directed acyclic graph (DAG) $$G$$ and a source vertex $$s$$ in $$G$$, it is NP-hard to find the longest distances from $$s$$ to all other vertices in $$G$$.
A.SAT, Vertex Cover, Hamiltonian Cycle, Clique, Knapsack, Bin Packing, and Domination Set problems are all NP-completeness problems.
B.If there is a polynomial time $$(1+\frac{1}{2n})$$-approximation algorithm for Vertex Cover with $$n$$ being the total number of vertices in the graph, then P=NP.
C.If there is a polynomial time 3/2-approximation algorithm for K-Center, then P=NP.
D.Given a weighted directed acyclic graph (DAG) $$G$$ and a source vertex $$s$$ in $$G$$, it is NP-hard to find the longest distances from $$s$$ to all other vertices in $$G$$.
答案：D