Unlike other books on theoretical computer science, this textbook organizes approximation algorithms into chapters based on the design techniques for the algorithms. This allows the reader to study approximation algorithms of the same nature together.
Ding-Zhu Du is co-editor of the first and soon-to-be published, second editions, of the Handbook of Combinatorial Optimization. He was also co-author with P.M. Pardalos and W. Wu of the Kluwer publication Mathematical Theory of Optimization . Du will co-author upcoming Springer publications (2012) entitled Connected Dominating Set: Theory and Applications and Introduction to Combinatorial Optimization . Prof. Du is also the EiC of the Journal of Combinatorial Optimization (Springer).Ker-I Ko is a well known expert in the field of theoretical computer science. He has authored a single publication with Birkhauser Computational Complexity of Real Functions in 1991, with very good reviews. Prof. Du and Ker-I Ko have written several texts together including Problem Solving in Automata, Languages, and Complexity John Wiley, 2001; Theory of Computational Complexity , John Wiley, 2000; Both of these books have received good reviews.Xiaodong Hu is an expert in combinatorial optimization. He is a member of the editorial boards of Journal of Combinatorial Optimization and Discrete Mathematics, Algorithms and Applications.