LEADER 03381nam 2200649 a 450 001 9910484229603321 005 20251117003051.0 010 $a3-540-32213-2 024 7 $a10.1007/11671541 035 $a(CKB)1000000000232815 035 $a(SSID)ssj0000317351 035 $a(PQKBManifestationID)11247728 035 $a(PQKBTitleCode)TC0000317351 035 $a(PQKBWorkID)10292903 035 $a(PQKB)11416650 035 $a(DE-He213)978-3-540-32213-9 035 $a(MiAaPQ)EBC3067924 035 $a(PPN)123131413 035 $a(BIP)28220783 035 $a(BIP)13248081 035 $a(EXLCZ)991000000000232815 100 $a20060104d2006 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aEfficient approximation and online algorithms $erecent progress on classical combinatorial optimization problems and new applications /$fEvripidis Bampis, Klaus Jansen, Claire Kenyon (eds.) 205 $a1st ed. 2006. 210 $aNew York $cSpringer$d2006 215 $a1 online resource (VII, 349 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v3484 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-32212-4 320 $aIncludes bibliographical references and index. 327 $aContributed Talks -- On Approximation Algorithms for Data Mining Applications -- A Survey of Approximation Results for Local Search Algorithms -- Approximation Algorithms for Path Coloring in Trees -- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow -- Independence and Coloring Problems on Intersection Graphs of Disks -- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications -- A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines -- Approximating a Class of Classification Problems -- List Scheduling in Order of ?-Points on a Single Machine -- Approximation Algorithms for the k-Median Problem -- The Lovász-Local-Lemma and Scheduling. 330 $aThis book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques. 410 0$aLecture notes in computer science ;$v3484. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 606 $aComputer algorithms 606 $aOnline algorithms 606 $aCombinatorial optimization$xData processing 615 0$aComputer algorithms. 615 0$aOnline algorithms. 615 0$aCombinatorial optimization$xData processing. 676 $a005.1 701 $aBampis$b Evripidis$01754801 701 $aJansen$b Klaus$0867301 701 $aKenyon$b Claire$01754802 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484229603321 996 $aEfficient approximation and online algorithms$94191296 997 $aUNINA