05382nam 22006735 450 99646592580331620230406060208.010.1007/11538462(CKB)1000000000213185(SSID)ssj0000316309(PQKBManifestationID)11205455(PQKBTitleCode)TC0000316309(PQKBWorkID)10275215(PQKB)10975978(DE-He213)978-3-540-31874-3(MiAaPQ)EBC3067939(PPN)123096766(EXLCZ)99100000000021318520100928d2005 u| 0engurnn|008mamaatxtccrApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques[electronic resource] 8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings /edited by Chandra Chekuri, Klaus Jansen, José D.P. Rolim, Luca Trevisan1st ed. 2005.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2005.1 online resource (XI, 495 p.) Theoretical Computer Science and General Issues,2512-2029 ;3624Bibliographic Level Mode of Issuance: Monograph3-540-31874-7 3-540-28239-4 Includes bibliographical references and index.Contributed Talks of APPROX -- The Network as a Storage Device: Dynamic Routing with Bounded Buffers -- Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT -- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs -- A Rounding Algorithm for Approximating Minimum Manhattan Networks -- Packing Element-Disjoint Steiner Trees -- Approximating the Bandwidth of Caterpillars -- Where’s the Winner? Max-Finding and Sorting with Metric Costs -- What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization -- The Complexity of Making Unique Choices: Approximating 1-in-k SAT -- Approximating the Distortion -- Approximating the Best-Fit Tree Under L p Norms -- Beating a Random Assignment -- Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints -- Approximation Algorithms for Network Design and Facility Location with Service Capacities -- Finding Graph Matchings in Data Streams -- A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses -- Efficient Approximation of Convex Recolorings -- Approximation Algorithms for Requirement Cut on Graphs -- Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems -- Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy -- Contributed Talks of RANDOM -- Bounds for Error Reduction with Few Quantum Queries -- Sampling Bounds for Stochastic Optimization -- An Improved Analysis of Mergers -- Finding a Maximum Independent Set in a Sparse Random Graph -- On the Error Parameter of Dispersers -- Tolerant Locally Testable Codes -- A Lower Bound on List Size for List Decoding -- A Lower Bound for Distribution-Free Monotonicity Testing -- On Learning Random DNF Formulas Under the Uniform Distribution -- Derandomized Constructions of k-Wise (Almost) Independent Permutations -- Testing Periodicity -- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem -- The Online Clique Avoidance Game on Random Graphs -- A Generating Function Method for the Average-Case Analysis of DPLL -- A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas -- Mixing Points on a Circle -- Derandomized Squaring of Graphs -- Tight Bounds for String Reconstruction Using Substring Queries -- Reconstructive Dispersers and Hitting Set Generators -- The Tensor Product of Two Codes Is Not Necessarily Robustly Testable -- Fractional Decompositions of Dense Hypergraphs.Theoretical Computer Science and General Issues,2512-2029 ;3624AlgorithmsNumerical analysisComputer science—MathematicsDiscrete mathematicsAlgorithmsNumerical AnalysisDiscrete Mathematics in Computer ScienceAlgorithms.Numerical analysis.Computer science—Mathematics.Discrete mathematics.Algorithms.Numerical Analysis.Discrete Mathematics in Computer Science.005.1Chekuri Chandraedthttp://id.loc.gov/vocabulary/relators/edtJansen Klausedthttp://id.loc.gov/vocabulary/relators/edtRolim José D.Pedthttp://id.loc.gov/vocabulary/relators/edtTrevisan Lucaedthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Randomization and Computation(9th :2005 :Berkeley, Calif.)BOOK996465925803316Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques772207UNISA