Which problem involves connecting a set of points with the shortest network that may include additional points not in the original set?

Which problem involves connecting a set of points with the shortest network that may include additional points not in the original set?

• A. Traveling salesman problem
• B. Vector based navigation
• C. The Steiner Tree Problem
• D. Desire paths

Answer: (C)

The main idea is to connect a set of points with the shortest network, and you’re allowed to add new junctions that aren’t in the original set. That’s exactly what the Steiner Tree Problem is about: you can place additional points (Steiner points) where routes meet to minimize the total length of the network that connects all the given points. This often yields a shorter solution than any network that only uses the original points, because those extra junctions let the lines branch more efficiently. For example, with three points, a central Steiner point can create a Y-shaped connection that uses less total length than linking the points pairwise around the triangle. This differs from the Traveling Salesman Problem, which asks for the shortest loop that visits every point exactly once without adding new points; vector-based navigation focuses on moving through space using vectors, and desire paths describe everyday informal routes rather than an optimized network.

The main idea is to connect a set of points with the shortest network, and you’re allowed to add new junctions that aren’t in the original set. That’s exactly what the Steiner Tree Problem is about: you can place additional points (Steiner points) where routes meet to minimize the total length of the network that connects all the given points. This often yields a shorter solution than any network that only uses the original points, because those extra junctions let the lines branch more efficiently. For example, with three points, a central Steiner point can create a Y-shaped connection that uses less total length than linking the points pairwise around the triangle. This differs from the Traveling Salesman Problem, which asks for the shortest loop that visits every point exactly once without adding new points; vector-based navigation focuses on moving through space using vectors, and desire paths describe everyday informal routes rather than an optimized network.