answersLogoWhite

0


Best Answer

both fesibility&objective

User Avatar

Wiki User

12y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is optimal reliability allocation in greedy approach?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the similar property between dynamic programming and greedy approach?

Both are using Optimal substructure , that is if an optimal solution to the problem contains optimal solutions to the sub-problems


What is the difference between greedy algorithm and Divide and Conquer?

greedy method does not give best solution always.but divide and conquer gives the best optimal solution only(for example:quick sort is the best sort).greedy method gives feasible solutions,they need not be optimal at all.divide and conquer and dynamic programming are techniques.


Are reliance fresh posing a threat to kirana stores?

The Reliance start chains of retail markets with turnover based approach by having very low margin and the items cheaper - quality, supply schedule, reliability, after sale service, personalised approach are the highlights which definetly throw out the middlemen, Dalals, greedy traders etc.


Does greedy algorithm always work?

Greedy algorithms are only guaranteed to produce locally optimal solutions within a given time frame; they cannot be guaranteed to find globally optimal solutions. However, since the intent is to find a solution that approximates the global solution within a reasonable time frame, in that sense they will always work. If the intent is to find the optimal solution, they will mostly fail.


What are advantages of greedy method?

Greedy algorithms are simple to implement and easy to understand. They typically have a low time complexity, making them efficient for some problems. Greedy algorithms can provide quick solutions when the problem can be solved by making locally optimal choices.


Advantages of the backtracking algorithm?

Backtracking algorithmn finds minimal path among the all.The main advantage of back tracking algorithmn as compare with greedy is to find minimal distance.In greedy ,it does.t know the optimal solution.It is used in Google earth.


Are mice greedy?

Yeah. They are greedy


Were greedy for more gold sentence or fragment?

The phrase 'were greedy for more gold' is a fragment. Who was greedy? Correct: The men were greedy for more gold. The miners were greedy for more gold.


Is Eminem greedy?

no eminem is not greedy...


How do you put greedy in a sentence?

You describe who is greedy. (the old man was very rich and greedy)


What part of speech is greedy?

Greedy is an adjective


Which one is better kruhskal's algorithm or prim's algorithm?

Both algorithms have the same efficiency and both are based on the same greedy approach. But Kruskal's algorithm is much easier to implement.