LEADER 06087nam 22008175 450 001 9910144026203321 005 20230804071526.0 010 $a3-540-45198-6 024 7 $a10.1007/b11961 035 $a(CKB)1000000000212116 035 $a(SSID)ssj0000321381 035 $a(PQKBManifestationID)11283926 035 $a(PQKBTitleCode)TC0000321381 035 $a(PQKBWorkID)10263551 035 $a(PQKB)10473254 035 $a(DE-He213)978-3-540-45198-3 035 $a(MiAaPQ)EBC4516828 035 $a(PPN)155221833 035 $a(EXLCZ)991000000000212116 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques $e6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 24-26,2003 /$fedited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (IX, 411 p.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v2764 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-40770-7 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aContributed Talks of APPROX -- Correlation Clustering with Partial Information -- Improved Linear Time Approximation Algorithms for Weighted Matchings -- Covering Graphs Using Trees and Stars -- An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor -- Approximation Algorithms for Channel Allocation Problems in Broadcast Networks -- Asymmetry in k-Center Variants -- An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times -- On the Complexity of Approximating k-Dimensional Matching -- Approximating Market Equilibria -- Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem -- On the Hardness of Approximate Multivariate Integration -- A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem -- Approximating Rooted Connectivity Augmentation Problems -- Effective Routing and Scheduling in Adversarial Queueing Networks -- Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement -- An Improved Algorithm for Approximating the Radii of Point Sets -- Contributed Talks of RANDOM -- Testing Low-Degree Polynomials over GF(2) -- Computational Analogues of Entropy -- Bounds on 2-Query Codeword Testing -- The Lovász Number of Random Graphs -- Perfectly Balanced Allocation -- On Extracting Private Randomness over a Public Channel -- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph -- The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems -- Continuous-Time Quantum Walks on the Symmetric Group -- Distribution-Free Property Testing -- On the Graph-Density of Random 0/1-Polytopes -- A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding -- Tight Bounds for Testing Bipartiteness in General Graphs -- Discrete Quantum Walks Hit Exponentially Faster -- Approximate Testing of Visual Properties -- Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances -- A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. 330 $aThis book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v2764 606 $aSoftware engineering 606 $aMathematical optimization 606 $aAlgorithms 606 $aNumerical analysis 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aSoftware Engineering 606 $aOptimization 606 $aAlgorithms 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 615 0$aSoftware engineering. 615 0$aMathematical optimization. 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aSoftware Engineering. 615 24$aOptimization. 615 24$aAlgorithms. 615 24$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.1 702 $aArora$b Sanjeev$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJansen$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRolim$b Jose D.P$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSahai$b Amit$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Workshop on Randomization and Approximation Techniques in Computer Science$d(7th :$f2003 :$ePrinceton, New Jersey) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144026203321 996 $aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques$9772207 997 $aUNINA