Greedy Approach in Periodic Maintenance of Virtual Machines

This project requires an expert on the above topic. The project is implementing the paper below. The virtual machine is to be simulated in this example the bamboo trees. Maintaining them means cutting them. And the written papers I provided were algorithms ( Cut-max algorithm, Cut total H algorithm and Cut faster growing above threshold) that are greedy and solve this problem. I want you to compare the solutions and implement the best one for this example. And about the paper I have the same issue. I cant access it unfortunately. The project description is Implementing the best solution for this problem ( bamboo tree problem) from the algorithms I provided and other solutions if there is any ( they should be greedy algorithms), the algorithms I provided can be modified and improved. After finding the best solution for this problem, we can compare it to a general virtual machine maintenance. Hope this helps. [login to view URL]