What algorithms should an air defense system work with? Particle swarm algorithms if there are ten targets to be hit. If there are more than ten targets, greedy algorithms work best. These ...

This paper analyzes a heuristic for the knapsack problem that recursively determines a solution by making a variable with smallest marginal unit cost as large as possible. Recursive necessary and ...

We consider the expected performance of two greedy matching algorithms on sparse random graphs and also on random trees. In all cases we establish expressions for the mean and variance of the number ...