Login / Signup
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness.
Cristina Bazgan
Bruno Escoffier
Vangelis Th. Paschos
Published in:
Theor. Comput. Sci. (2005)
Keyphrases
</>
approximation algorithms
approximation schemes
polynomial time approximation
closed form
data quality
databases
case study
database
evolutionary algorithm
special case
np hard
probability distribution
class labels
approximation error
approximation ratio
formal proofs