Review of A l g o r i t h m i c s for H a r d P r o b l e m s : 4 I n t r o d u c t i o n to C o m b i n a t o r i a l O p t i m i z a t i o n , R a n d o m i z a t i o n , A p p r o x i m a t i o n , a n d H e u r i s t i c s Juraj Hromkovi~ P u b l i s h e r : Springer~ 2001 ISBN: 3-540-66860-8 R e v i e w by: H a s s a n M a s u m (hmasum.com) Carleton University~ Ottawa~ C a n a d a Overview Algorithmics for Hard Problems is an intriguing new book that attempts to fill an underserved niche: practical methods for attacking those pesky problems that are NP-hard but must nevertheless be dealt with. On the whole, the book is well-written and forms a useful introduction
/lp/association-for-computing-machinery/review-of-algorithmics-for-hard-problems-introduction-to-combinatorial-5U0yqXB0tw