New answers tagged greedy-algorithms
2
If the greediness here means moving on the input based on a specified score, and computation of the input item's score is polynomial, the answer is yes. It is correct. Because moving on the input with $n$ items is linear, and if the scoring computation for each item will be polynomial, as sorting them will be polynomial as well; finally, we can solve the ...
Top 50 recent answers are included
Related Tags
greedy-algorithms × 319algorithms × 193
optimization × 51
dynamic-programming × 51
graphs × 49
correctness-proof × 32
algorithm-analysis × 25
approximation × 25
scheduling × 20
knapsack-problems × 14
proof-techniques × 12
intervals × 11
combinatorics × 10
time-complexity × 9
set-cover × 8
matroids × 8
minimum-spanning-tree × 7
sorting × 6
shortest-path × 6
np-complete × 5
np-hard × 5
number-theory × 5
heuristics × 5
spanning-trees × 5
algorithm-design × 5