Defying hardness with a hybrid approach

Abstract

A hybrid algorithm is a collection of heuristics, paired with a polynomial time procedure S (called a selector) that decides based on a preliminary scan of the input which heuristic should be executed. We investigate scenarios where the selector must decide between heuristics that are “good” with respect to different complexity measures, e.g. heuristic h1… (More)

1 Figure or Table

Topics

  • Presentations referencing similar topics