Improving Greedy Algorithms by Lookahead
โ
U.K. Sarkar; P.P. Chakrabarti; S. Ghose; S.C. Desarkar
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 967 KB
This paper shows that repeated application of a greedy approximation algorithm on some suitably selected subproblems of a problem often leads to a solution which is better than the solution produced by the greedy algorithm applied to the original problem. The lookahead search technique, a polynomial