| Record ID | marc_columbia/Columbia-extract-20221130-005.mrc:122882406:2603 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-005.mrc:122882406:2603?format=raw |
LEADER: 02603fam a2200349 a 4500
001 2094830
005 20220615202627.0
008 950717t19971997maua b 001 0 eng
010 $a 95031849
020 $a0534949681 (hardcover : acid-free paper)
035 $a(OCoLC)32923622
035 $a(OCoLC)ocm32923622
035 $9ANC5164CU
035 $a(NNC)2094830
035 $a2094830
040 $aDLC$cDLC$dDLC$dOrLoB-B
050 00 $aT57.7$b.A68 1997
082 00 $a511/.42$220
245 00 $aApproximation algorithms for NP-hard problems /$cedited by Dorit S. Hochbaum.
260 $aBoston :$bPWS Pub. Co.,$c[1997], ©1997.
300 $axxii, 596 pages :$billustrations ;$c24 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
504 $aIncludes bibliographical references and index.
505 00 $tIntroduction /$rDorit S. Hochbaum --$g1.$tApproximation Algorithms in Scheduling /$rLeslie A. Hall --$g2.$tApproximation Algorithms for Bin Packing: A Survey /$rE. G. Coffman, Jr., M. R. Garey and D. S. Johnson --$g3.$tApproximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems /$rDorit S. Hochbaum --$g4.$tThe Primal-Dual Method for Approximation Algorithms and Its Application to Network Design Problems /$rMichel X. Goemans and David P. Williamson --$g5.$tCut Problems and Their Application to Divide-and-Conquer /$rDavid B. Shmoys --$g6.$tApproximation Algorithms for Finding Highly Connected Subgraphs /$rSamir Khuller --$g7.$tAlgorithms for Finding Low Degree Structures /$rBalaji Raghavachari --$g8.$tApproximation Algorithms for Geometric Problems /$rMarshall Bern and David Eppstein --$g9.$tVarious Notions of Approximations: Good, Better, Best, and More /$rDorit S. Hochbaum --$g10.$tHardness of Approximations /$rSanjeev Arora and Carsten Lund --
505 80 $g11.$tRandomized Approximation Algorithms in Combinatorial Optimization /$rRajeev Motwani, Joseph (Seffi) Naor and Prabhakar Raghavan --$g12.$tThe Markov Chain Monte Carlo Method: An Approach to Approximate Counting and Integration /$rMark Jerrum and Alistair Sinclair --$g13.$tOnline Computation /$rSandy Irani and Anna R. Karlin.
650 0 $aProgramming (Mathematics)$0http://id.loc.gov/authorities/subjects/sh85107312
650 0 $aApproximation theory.$0http://id.loc.gov/authorities/subjects/sh85006190
650 0 $aAlgorithms.$0http://id.loc.gov/authorities/subjects/sh85003487
700 1 $aHochbaum, Dorit S.$0http://id.loc.gov/authorities/names/n95071877
852 00 $boff,eng$hT57.7$i.A68 1997
852 00 $bsci$hT57.7$i.A68 1997