04282oam 2200577 450 99646559810331620210715111957.03-540-48413-210.1007/b72324(CKB)1000000000211192(SSID)ssj0000326088(PQKBManifestationID)11230934(PQKBTitleCode)TC0000326088(PQKBWorkID)10265417(PQKB)10674350(DE-He213)978-3-540-48413-4(MiAaPQ)EBC3088708(MiAaPQ)EBC6485848(PPN)155211137(EXLCZ)99100000000021119220210715d1999 uy 0engurnn|008mamaatxtccrRandomization, approximation and combinatorial optimization algorithms 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 /Dorit Hochbaum [and three others], editors1st ed. 1999.Berlin ;Heidelberg :Springer,[1999]©19991 online resource (X, 298 p.) Lecture Notes in Computer Science ;1671Bibliographic Level Mode of Issuance: Monograph3-540-66329-0 Includes bibliographical references at the end of each chapters and index.Session 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.Lecture notes in computer science ;1671.Computer scienceCongressesComputer scienceStatistical methodsCongressesComputer scienceComputer scienceStatistical methods004.015113Hochbaum Dorit S.International Workshop on Randomization and Approximation Techniques in Computer ScienceMiAaPQMiAaPQUtOrBLWBOOK996465598103316Randomization, approximation and combinatorial optimization2240115UNISA