05942nam 22007215 450 99646606110331620230406043244.03-540-38045-010.1007/11830924(CKB)1000000000283736(SSID)ssj0000316310(PQKBManifestationID)11246734(PQKBTitleCode)TC0000316310(PQKBWorkID)10263649(PQKB)10460261(DE-He213)978-3-540-38045-0(MiAaPQ)EBC4516814(PPN)123137721(EXLCZ)99100000000028373620100301d2006 u| 0engurnn|008mamaatxtccrApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques[electronic resource] 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006, Proceedings /edited by Josep Diaz, Klaus Jansen, José D.P. Rolim, Uri Zwick1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (XII, 522 p.) Theoretical Computer Science and General Issues,2512-2029 ;4110Bibliographic Level Mode of Issuance: Monograph3-540-38044-2 Includes bibliographical references and index.Invited Talks -- On Nontrivial Approximation of CSPs -- Analysis of Algorithms on the Cores of Random Graphs -- Contributed Talks of APPROX -- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs -- Approximating Precedence-Constrained Single Machine Scheduling by Coloring -- Minimizing Setup and Beam-On Times in Radiation Therapy -- On the Value of Preemption in Scheduling -- An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs -- Tight Results on Minimum Entropy Set Cover -- A Tight Lower Bound for the Steiner Point Removal Problem on Trees -- Single-Source Stochastic Routing -- An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem -- Online Algorithms to Minimize Resource Reallocations and Network Communication -- Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs -- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time -- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times -- Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees -- Improved Algorithms for Data Migration -- Approximation Algorithms for Graph Homomorphism Problems -- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem -- Hardness of Preemptive Finite Capacity Dial-a-Ride -- Minimum Vehicle Routing with a Common Deadline -- Stochastic Combinatorial Optimization with Controllable Risk Aversion Level -- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems -- Better Approximations for the Minimum Common Integer Partition Problem -- Contributed Talks of RANDOM -- On Pseudorandom Generators with Linear Stretch in NC0 -- A Fast Random Sampling Algorithm for Sparsifying Matrices -- The Effect of Boundary Conditions on Mixing Rates of Markov Chains -- Adaptive Sampling and Fast Low-Rank Matrix Approximation -- Robust Local Testability of Tensor Products of LDPC Codes -- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods -- Dobrushin Conditions and Systematic Scan -- Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems -- Robust Mixing -- Approximating Average Parameters of Graphs -- Local Decoding and Testing for Homomorphisms -- Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy -- Randomness-Efficient Sampling Within NC 1 -- Monotone Circuits for the Majority Function -- Space Complexity vs. Query Complexity -- Consistency of Local Density Matrices Is QMA-Complete -- On Bounded Distance Decoding for General Lattices -- Threshold Functions for Asymmetric Ramsey Properties Involving Cliques -- Distance Approximation in Bounded-Degree and General Sparse Graphs -- Fractional Matching Via Balls-and-Bins -- A Randomized Solver for Linear Systems with Exponential Convergence -- Maintaining External Memory Efficient Hash Tables.Theoretical Computer Science and General Issues,2512-2029 ;4110Software engineeringAlgorithmsComputer science—MathematicsDiscrete mathematicsNumerical analysisSoftware EngineeringAlgorithmsDiscrete Mathematics in Computer ScienceNumerical AnalysisSoftware engineering.Algorithms.Computer science—Mathematics.Discrete mathematics.Numerical analysis.Software Engineering.Algorithms.Discrete Mathematics in Computer Science.Numerical Analysis.005.1Diaz Josepedthttp://id.loc.gov/vocabulary/relators/edtJansen Klausedthttp://id.loc.gov/vocabulary/relators/edtRolim José D.Pedthttp://id.loc.gov/vocabulary/relators/edtZwick Uriedthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Randomization and Computation(10th :2006 :Barcelona, Spain)BOOK996466061103316Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques772207UNISA