LEADER 04264nam  22008295  450 
001 996466063803316
005 20230406010253.0
010   $a3-642-22935-2
024 7 $a10.1007/978-3-642-22935-0
035   $a(CKB)2550000000052123
035   $a(SSID)ssj0000609177
035   $a(PQKBManifestationID)11411937
035   $a(PQKBTitleCode)TC0000609177
035   $a(PQKBWorkID)10610066
035   $a(PQKB)11767261
035   $a(DE-He213)978-3-642-22935-0
035   $a(MiAaPQ)EBC3067156
035   $a(PPN)156314827
035   $a(EXLCZ)992550000000052123
100   $a20110812d2011      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques$b[electronic resource] $e14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011, Proceedings /$fedited by Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D.P. Rolim
205   $a1st ed. 2011.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2011.
215   $a1 online resource (XV, 702 p.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6845
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-22934-4 
320   $aIncludes bibliographical references and index.
327   $aNew tools for graph coloring / Sanjeev Arora, Rong Ge -- Inapproximability of NP-complete variants of Nash equilibrium / Per Austrin, Mark Braverman, Eden Chlamta?c?.
330   $aThis book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011. The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6845
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aArtificial intelligence?Data processing
606   $aComputer science
606   $aComputer graphics
606   $aComputer networks
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aData Science
606   $aTheory of Computation
606   $aComputer Graphics
606   $aComputer Communication Networks
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aArtificial intelligence?Data processing.
615  0$aComputer science.
615  0$aComputer graphics.
615  0$aComputer networks.
615 14$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aData Science.
615 24$aTheory of Computation.
615 24$aComputer Graphics.
615 24$aComputer Communication Networks.
676   $a005.1
702   $aGoldberg$b Leslie Ann$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aJansen$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aRavi$b R$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aRolim$b José D.P$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aInternational Workshop on Randomization and Computation$d(15th :$f2011 :$ePrinceton, N.J.)
906   $aBOOK
912   $a996466063803316
996   $aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques$9772207
997   $aUNISA