LEADER 06522nam 22008655 450 001 996465806303316 005 20200706080339.0 010 $a3-540-44666-4 024 7 $a10.1007/3-540-44666-4 035 $a(CKB)1000000000211538 035 $a(SSID)ssj0000321382 035 $a(PQKBManifestationID)11241020 035 $a(PQKBTitleCode)TC0000321382 035 $a(PQKBWorkID)10262967 035 $a(PQKB)11132999 035 $a(DE-He213)978-3-540-44666-8 035 $a(MiAaPQ)EBC4516819 035 $a(PPN)155237446 035 $a(EXLCZ)991000000000211538 100 $a20121227d2001 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] $e4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA,USA, August 18-20, 2001 /$fedited by Michel Goemans, Klaus Jansen, Jose D.P. Rolim, Luca Trevisan 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (IX, 296 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2129 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42470-9 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talks -- Using Complex Semidefinite Programming for Approximating MAX E2-LIN3 -- Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems -- Web Search via Hub Synthesis -- Error-Correcting Codes and Pseudorandom Projections -- Order in Pseudorandomness -- Contributed Talks of APPROX -- Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows -- On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique -- Online Weighted Flow Time and Deadline Scheduling -- An Online Algorithm for the Postman Problem with a Small Penalty -- A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem -- Approximation Schemes for Ordered Vector Packing Problems -- Incremental Codes -- A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set -- Approximation Algorithms for Budget-Constrained Auctions -- Minimizing Average Completion of Dedicated Tasks and Interval Graphs -- A Greedy Facility Location Algorithm Analyzed Using Dual Fitting -- 0.863-Approximation Algorithm for MAX DICUT -- The Maximum Acyclic Subgraph Problem and Degree-3 Graphs -- Some Approximation Results for the Maximum Agreement Forest Problem -- Contributed Talks of RANDOM -- Near-optimum Universal Graphs for Graphs with Bounded Degrees -- On a Generalized Ruin Problem -- On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation -- Exact Sampling in Machine Scheduling Problems -- On Computing Ad-hoc Selective Families -- L Infinity Embeddings -- On Euclidean Embeddings and Bandwidth Minimization -- The Non-approximability of Non-Boolean Predicates -- On the Derandomization of Constant Depth Circuits -- Testing Parenthesis Languages -- Proclaiming Dictators and Juntas or Testing Boolean Formulae -- Equitable Coloring Extends Chernoff-Hoeffding Bounds. 330 $aThis book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2129 606 $aMathematical analysis 606 $aAnalysis (Mathematics) 606 $aComputer programming 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aNumerical analysis 606 $aCombinatorics 606 $aAnalysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M12007 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aMathematical analysis. 615 0$aAnalysis (Mathematics). 615 0$aComputer programming. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aCombinatorics. 615 14$aAnalysis. 615 24$aProgramming Techniques. 615 24$aDiscrete Mathematics. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aNumeric Computing. 615 24$aCombinatorics. 676 $a004/.01/5114 702 $aGoemans$b Michel$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 $aTrevisan$b Luca$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Workshop on Approximation Algorithms for Combinatorial Optimization Problems 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465806303316 996 $aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques$9772207 997 $aUNISA