Reductions, completeness and the hardness of approximability.

Giorgio Ausiello Vangelis Th. Paschos

Published in: Eur. J. Oper. Res. (2006)

Keyphrases

approximation algorithms
computational complexity
np hardness
np hard
phase transition
search engine
learning theory
worst case
information theoretic
data quality
data sets
machine learning
decision trees
special case
formal proofs