Online minimum spanning tree: competitive ratio of greedy algorithm.
Analyze the online minimum spanning tree: competitive ratio of greedy algorithm..
Examples
Input:"test_input_1"
Output:"output_1"
Input:"test_input_2"
Output:"output_2"
Hints
Consider how the greedy algorithm selects edges in the context of an online setting, where future edges are unknown.
Analyze the worst-case scenario where the greedy choice leads to a suboptimal spanning tree, and quantify the competitive ratio.
Explore the use of potential functions or dual-fitting techniques to bound the competitive ratio of the greedy algorithm against the optimal offline solution.
Online minimum spanning tree: competitive ratio of greedy algorithm.
Analyze the online minimum spanning tree: competitive ratio of greedy algorithm..