Domination analysis for minimum multiprocessor scheduling

Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obtained by A for any instance I of P of size s is not worse than at least the fraction q of the feasible solutions of I. We say that P admits an Asymptotic Domination Ratio One (ADRO) algorithm if there is a polynomial time approximation algorithm A

• Type: Journal
• Year: 2006
• Where: DAM
• Authors: Gregory Gutin, Tommy R. Jensen, Anders Yeo
• Keywords: Approximation Algorithm, Combinatorial Optimization Problem, DAM 2006, Domination Ratio