LEADER 04282oam 2200577 450 001 996465598103316 005 20210715111957.0 010 $a3-540-48413-2 024 7 $a10.1007/b72324 035 $a(CKB)1000000000211192 035 $a(SSID)ssj0000326088 035 $a(PQKBManifestationID)11230934 035 $a(PQKBTitleCode)TC0000326088 035 $a(PQKBWorkID)10265417 035 $a(PQKB)10674350 035 $a(DE-He213)978-3-540-48413-4 035 $a(MiAaPQ)EBC3088708 035 $a(MiAaPQ)EBC6485848 035 $a(PPN)155211137 035 $a(EXLCZ)991000000000211192 100 $a20210715d1999 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aRandomization, approximation and combinatorial optimization $ealgorithms and techniques : Third International Workshop on Randomization and approximation Techniques in Computer Science and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX '99 Berkeley, USA, August 8-11, 1999 : proceedings /$fDorit Hochbaum [and three others], editors 205 $a1st ed. 1999. 210 1$aBerlin ;$aHeidelberg :$cSpringer,$d[1999] 210 4$d©1999 215 $a1 online resource (X, 298 p.) 225 1 $aLecture Notes in Computer Science ;$v1671 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-66329-0 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aSession Random 1 -- Completeness and Robustness Properties of Min-Wise Independent Permutations -- Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families -- Session Approx 1 -- Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths -- Approximating Minimum Manhattan Networks -- Approximation of Multi-Color Discrepancy -- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem -- Session Approx 2 -- Set Cover with Requirements and Costs Evolving over Time -- Multicoloring Planar Graphs and Partial k-Trees -- Session: Random 2 -- Testing the Diameter of Graphs -- Improved Testing Algorithms for Monotonicity -- Linear Consistency Testing -- Improved Bounds for Sampling Contingency Tables -- Invited Talk -- Probabilistic and Deterministic Approximations of the Permanent -- Session Random 3 -- Improved Derandomization of BPP Using a Hitting Set Generator -- Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets -- Session Approx 3 -- Stochastic Machine Scheduling: Performance Guarantees for LP-Based Priority Policies -- Efficient Redundant Assignments under Fault-Tolerance Constraints -- Scheduling with Machine Cost -- A Linear Time Approximation Scheme for the Job Shop Scheduling Problem -- Invited Talk -- Randomized Rounding for Semidefinite Programs ? Variations on the MAX CUT Example -- Session Approx 4 -- Hardness Results for the Power Range Assignment Problem in Packet Radio Networks -- A New Approximation Algorithm for the Demand Routing and Slotting Problem with Unit Demands on Rings -- Session Random 4 -- Algorithms for Graph Partitioning on the Planted Partition Model -- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest -- Fast Approximate PCPs for Multidimensional Bin-Packing Problems -- Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions -- Minisymposium on Scheduling Talks -- Scheduling with Unexpected Machine Breakdowns -- Scheduling on a Constant Number of Machines. 410 0$aLecture notes in computer science ;$v1671. 606 $aComputer science$vCongresses 606 $aComputer science$xStatistical methods$vCongresses 615 0$aComputer science 615 0$aComputer science$xStatistical methods 676 $a004.015113 702 $aHochbaum$b Dorit S. 712 12$aInternational Workshop on Randomization and Approximation Techniques in Computer Science 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996465598103316 996 $aRandomization, approximation and combinatorial optimization$92240115 997 $aUNISA