On the Greedy Heuristic for Matchings


Heuristics are widely employed in practice for approximating solutions to problems of combinatorial optimization. The reduced running time of an heuristic often compensates for the difference from exact optimality in the solution obtained. This has led to theoretical interest in quantifying the efficiency of heuristics. The most common measure of solution… (More)