Approximation algorithms for NP-hard problems / 
edited by Dorit S. Hochbaum. 
 - Boston :  PWS Pub. Co.,  c1997. 
 - xxii, 596 p. :  ill. ;  24 cm. +\ehbk. 
<br/><br/>Includes bibliographical references and index. 
<br/><br/>Introduction / Dorit S Hochbaum -- Approximation algorithms for scheduling / Leslie A. Hall -- Approximation, algorithms for bin packing; a survey / E. G. Coffman, Jr. M. R. Garey and D. S. Johnson -- Approximating covering and packing problems: set cover, vertex cover, independent set and related problems / Dorit S. Hochbaum -- The primal-dual method for approximation algorithms and its application to network design problems / Michel X. Goemans and David P. Williamson -- Cut problems and their application to divide-and-conquer/ David B. Shmoys -- Approximation algorithms for finding highly connected subgraphs / Samir Khuller -- Algorithms for finding low degree structures / Balaji Raghavachari -- Approximation algorithms for geometric problems / Marshall Bern and David Eppstein -- Various notations of approximations: good, better, best and more / Dorit S. Hochbaum -- Hardness of approximations / Sanjeev Anora and Carsten Land -- Randomized approximation algorithms in combinatorial optimization / Rajeev Motwani, Joseph (Seffi) Naor and Prabhakar Raghavan -- The Markov chain Monte Carlo method: an approach to approximate counting and integration / Mark Jerrum and Alistair Sinclair -- Online computation / Sandy Irani and Anna R. Karlin. 
<br/><br/><label>ISBN: </label>0534949681 
<br/><br/><label>LCCN: </label>95031849 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Programming (Mathematics)<br/>Approximation theory.<br/>Algorithms.
<br/><br/><label>Dewey Class. No.: </label>511.42