DESIGN and ANALYSIS of APPROXIMATI0N ALGORITHMS
Tahun : 2011Pengarang : DING ZHU DU
Penerbit : spinger science
Ket : When exact solutions are hard to compute, approximation algorithms can help. In this chapter, we introduce the basic notions of approximation algorithms. We study a simple optimization problem to demonstrate the tradeoff between the time complexity and performance ratio of its approximation algorithms. We also present a brief introduction to the general theory of computational complexity and show how to apply this theory to classify optimization problems according to their approximability.
Ketegori : ALGORITMA
