Suppose a Maintenance Worker Needs to Empty Garbage Dumpsters from Five

question 103

Multiple Choice

Suppose a maintenance worker needs to empty garbage dumpsters from five locations on the grounds of a park in the most efficient way possible. Which technique is most likely to be useful in solving this problem?

• A) Finding an Euler circuit on a graph
• B) Applying the nearest-neighbor algorithm for the traveling salesman problem
• C) Applying Kruskal's algorithm for finding a minimum-cost spanning tree for a graph
• D) None of these techniques is likely to apply