# Approximation, randomization, and combinatorial optimization : algorithms and techniques : 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005 : proceedings / Chandra Chekuri [and others] (eds.).

Material type: TextSeries: Serienbezeichnung | Lecture notes in computer science ; 3624.Publication details: Berlin ; New York : Springer, ©2005. Description: 1 online resource (xi, 493 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540318743; 3540318747; 3540282394; 9783540282396; 6611403906; 9786611403904Other title: APPROX 2005 | RANDOM 2005 | 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems | Eighth International Workshop on Approximation Algorithms for Combinatorial Optimization Problems | International Workshop on Approximation Algorithms for Combinatorial Optimization Problems | 9th International Workshop on Randomization and Computation | Ninth International Workshop on Randomization and Computation | International Workshop on Randomization and ComputationSubject(s): Computer science -- Statistical methods -- Congresses | Computer algorithms -- Congresses | Approximation algorithms -- Congresses | Approximation theory -- Data processing -- Congresses | Combinatorial optimization -- Data processing -- Congresses | Algorithmes -- Congrès | Théorie de l'approximation -- Informatique -- Congrès | Optimisation combinatoire -- Informatique -- Congrès | Informatique -- Méthodes statistiques -- Congrès | Algorithmes d'approximation -- Congrès | COMPUTERS -- Reference | COMPUTERS -- Machine Theory | COMPUTERS -- Computer Literacy | COMPUTERS -- Information Technology | COMPUTERS -- Data Processing | COMPUTERS -- Computer Science | COMPUTERS -- Hardware -- General | Informatique | Approximation algorithms | Computer algorithms | Computer science -- Statistical methods | Théorie de l'approximation | Optimisation combinatoire | Algorithme | RandomisationGenre/Form: Congress | Electronic books. | Conference papers and proceedings. | Conference papers and proceedings. | Actes de congrès. Additional physical formats: Print version:: Approximation, randomization, and combinatorial optimization.DDC classification: 005.1 LOC classification: QA75.5 | .I643 2005ebOther classification: 54.10 | SS 4800 | DAT 532f | DAT 517f | MAT 913f Online resources: Click here to access onlineItem type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|

eBook |
e-Library
Electronic Book@IST |
EBook_LNCS | Available |

Includes bibliographical references and index.

"This volume contains the papers presented at the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005) and the 9th International Workshop on Randomization and Computation (RANDOM 2005), which took place concurrently at the University of California in Berkeley, on August 22 -24, 2005."

Print version record.

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.

English.