FTP, name this notorious NP-complete problem that is concerned with traversing all nodes in a network while keeping the path length to a minimum.
One instance of this problem occurs with the soldering of parts to a circuit board by a robot.  It can be solved using the elastic net method, where a circular route is mapped to the plane and iteratively stretched out towards all points on the plane to define a route.  The complexity still rises exponentially with the number of points or "cities"in the problem.  FTP, name this notorious NP-complete problem that is concerned with traversing all nodes in a network while keeping the path length to a minimum.
One instance of this problem occurs with the soldering of parts to a circuit board by a robot.  
traveling salesman problem