Roads in the city of Winterville are organized as a tree. Every snowy morning a

Question

Roads in the city of Winterville are organized as a tree. Every snowy morning a snow plow

goes around clearing roads in the city with the goal of clearing as many intersections as

possible. It starts from a depot at the root of the tree and returns to the depot at the end of

the day.

When the roads are really bad, the snow plow cannot clear all intersections during the day.

Give a strongly polynomial time algorithm to determine what route it should take to clear

as many as possible by a certain deadline. Assume that you are given the precise (integral)

amount of time it will take the plow to go over each road.

Explanation / Answer

You can go for Minimum Spanning Tree algorithm like Prim;s Algorithm or Kruskal Algorithm which run in O(V+E) running time that is approximately O(V^2)

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.