Confronting hardness using a hybrid approach

@inproceedings{Williams2006ConfrontingHU,
  title={Confronting hardness using a hybrid approach},
  author={Virginia Vassilevska Williams and Ryan Williams and Maverick Woo},
  booktitle={SODA},
  year={2006}
}
A hybrid algorithm is a collection of <i>heuristics</i>, paired with a polynomial time <i>selector S</i> 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 "hardness-defying" property: for a problem II, there is a set of complexity measures {<i>m</i… CONTINUE READING
21 Citations
7 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Similar Papers

Loading similar papers…