FPGA implementation of a greedy algorithm for set covering

A version of a new greedy algorithm for approximating minimum set cover is presented. The algorithm, while not randomized, is based on a probability distribution that leads the greedy choice. The algorithm has been specifically tailored to run on platforms with minimal computational hardware. We also describe an implementation based on a FPGA which makes the algorithm suitable for embedded and real-time architectures.