LEADER 03416nam  22007455  450 
001 996466155203316
005 20230406053020.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(EXLCZ)991000000000232815
100   $a20100714d2006      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aEfficient Approximation and Online Algorithms$b[electronic resource] $eRecent Progress on Classical Combinatorial Optimization Problems and New Applications /$fedited by Evripidis Bampis, Klaus Jansen, Claire Kenyon
205   $a1st ed. 2006.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006.
215   $a1 online resource (VII, 349 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3484
300   $aBibliographic Level Mode of Issuance: Monograph
311   $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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3484
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aNumerical analysis
606   $aComputer networks
606   $aComputer graphics
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aNumerical Analysis
606   $aComputer Communication Networks
606   $aComputer Graphics
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aNumerical analysis.
615  0$aComputer networks.
615  0$aComputer graphics.
615 14$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aNumerical Analysis.
615 24$aComputer Communication Networks.
615 24$aComputer Graphics.
676   $a005.1
702   $aBampis$b Evripidis$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aJansen$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aKenyon$b Claire$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996466155203316
996   $aEfficient Approximation and Online Algorithms$9772336
997   $aUNISA