A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Confronting hardness using a hybrid approach
2006
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06
A hybrid algorithm is a collection of heuristics, paired with a polynomial time selector S that runs on the input to decide which heuristic should be executed to solve the problem. Hybrid algorithms are of particular interest in scenarios where the selector must decide between heuristics that are "good" with respect to different complexity measures. We focus on hybrid algorithms with a "hardnessdefying" property: for a problem Π, there is a set of complexity measures {m i } whereby Π is known
doi:10.1145/1109557.1109558
fatcat:4g2juiedlbgbxjodluo5v6rwo4