Question: Maximum Flow Reductions (3 points) We have seen that several problems can be reduced to the maximum flow problem. Recently, a researcher uploaded a manuscript

Maximum Flow Reductions (3 points) We have seen that several problems can be reduced to the maximum flow problem. Recently, a researcher uploaded a manuscript to the arXiv*. He claims that the traveling salesman problem for n cities can be reduced in polynomial time to computing the maximum flow in a flow network with O(n) nodes. Give a short reasoning why the manuscript is either wrong or very big news? *arXiv is a non-peer reviewed open access service for research articles. 7 A- B 1 jji INT ER
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
