The Book Review Column s by William Gasarc h Department of Computer Scienc e University of Maryland at College Par k College Park, MD, 20742 email: gasarch@cs . umd . ed u Welcome to the Book Reviews Column . We hope to bring you at least three reviews of books ever y month . In this column three books are reviewed . 1. Approximation Algorithms for NP-hard Problems , Edited by Dorit S . Hochbaum . Reviewed by Randeep Bhatia and Yoram J . Sussmann . This is a collection of articles (b y different authors) on approximating a large variety of NP-hard problems . 2. Selected Papers on Computer Science by Donald E . Knuth . Reviewed by Samir Khuller . This is a collection of articles on computer science by Donald E . Knuth . They are intended for a wide audience . 3. Communication Complexity by Eyal Kushilevitz and Noam Nisan . Reviewed by Willia m Gasarch . This is a monograph on communication complexity . Review o f Approximation Algorithms for NP-hard Problems ? Editor : Dorit S . Hochbau m Publisher : PWS, 199 7 Reviewed by : Randeep Bhatia and Yoram J . Sussmann University Of Maryland, College Park . 1 Overview This book is the first comprehensive guide to the field of approximation algorithms . It is organize d as a series of more or less stand-alone chapters on topics ranging from inapproximability proofs t o the development of approximation algorithms for several important classes of NP-hard problems . Most of the chapters are devoted to a survey of a specific class of problems ; however there ar e also several chapters that focus on a specific issue or technique in the field, such as hardness o f approximation or randomization . 2 Summary of Content s Approximation Algorithms for Scheduling . By Leslie A . Hall . The algorithms presente d in this chapter span three decades of research beginning with Graham's List Scheduling, widel y believed to be the first heuristic analyzed for its worst case performance, to the recent work o n designing approximation algorithms for scheduling problems with min-sum objective functions . In addition the chapter is a comprehensive survey of many basic scheduling problems such as thos e in which the objective is to minimize the maximum completion time, lateness etc . under variou s I () William Gasarch, 1998 . 2 © Randeep Bhatia and Yoram J . Sussmann, 1998
/lp/association-for-computing-machinery/book-review-approximation-algorithms-for-np-hard-problems-edited-by-iIgACFVzbG
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Free Article
Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997)
Reviewer-Bhatia, Randeep; Reviewer-Sussmann, Yoram J.
Follow ACM SIGACT News
, Volume 29 (2)
Association for Computing Machinery – Jun 1, 1998
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
