Approximation, randomization, and combinatorial optimization : algorithms and techniques : 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004 : proceedings / Klaus Jansen [and others] (eds.).
By: (7th : International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (7th : 2004 : Cambridge, Mass.)
Contributor(s): Jansen, Klaus | International Workshop on Randomization and Approximation Techniques in Computer Science (8th : 2004 : Cambridge, Mass.)Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 3122.Publisher: Berlin ; New York : Springer, 2004Description: 1 online resource (ix, 428 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 3540278214; 9783540278214Other title: APPROX 2004 | RANDOM 2004Subject(s): Computer science -- Statistical methods -- Congresses | Computer algorithms -- Congresses | COMPUTERS -- Reference | COMPUTERS -- Machine Theory | COMPUTERS -- Computer Literacy | COMPUTERS -- Information Technology | COMPUTERS -- Data Processing | COMPUTERS -- Computer Science | COMPUTERS -- Hardware -- General | Computer algorithms | Computer science -- Statistical methodsGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Approximation, randomization, and combinatorial optimization.DDC classification: 004/.01/51 LOC classification: QA75.5 | .I643 2004Other classification: 54.10 | DAT 517f | MAT 913f | SS 4800 Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
This book constitutes the joint refereed proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and the 8th International Workshop on Randomization and Computation, RANDOM 2004, held in Cambridge, MA, USA in August 2004. The 37 revised full papers presented were carefully reviewed and selected from 87 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, approximation classes, online problems, graph algorithms, cuts, geometric computations, network design and routing, packing and covering, scheduling, game theory, design and analysis of randomised algorithms, randomized complexity theory, pseudorandomness, derandomization, probabilistic proof systems, error-correcting codes, and other applications of approximation and randomness.
Contributed Talks of APPROX -- Designing Networks with Existing Traffic to Support Fast Restoration -- Simultaneous Source Location -- Computationally-Feasible Truthful Auctions for Convex Bundles -- Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks -- On the Crossing Spanning Tree Problem -- A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One -- Maximum Coverage Problem with Group Budget Constraints and Applications -- The Greedy Algorithm for the Minimum Common String Partition Problem -- Approximating Additive Distortion of Embeddings into Line Metrics -- Polylogarithmic Inapproximability of the Radio Broadcast Problem -- On Systems of Linear Equations with Two Variables per Equation -- An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case -- Cost-Sharing Mechanisms for Network Design -- Approximating Max k CSP Using Random Restrictions -- Approximation Schemes for Broadcasting in Heterogenous Networks -- Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks -- Convergence Issues in Competitive Games -- Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem -- Min-Max Multiway Cut -- Contributed Talks of RANDOM -- The Chromatic Number of Random Regular Graphs -- Estimating the Distance to a Monotone Function -- Edge Coloring with Delays -- Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption -- The Sketching Complexity of Pattern Matching -- Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions -- Robust Locally Testable Codes and Products of Codes -- A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes -- Strong Refutation Heuristics for Random k-SAT -- Counting Connected Graphs and Hypergraphs via the Probabilistic Method -- Improved Randomness Extraction from Two Independent Sources -- The Diameter of Randomly Perturbed Digraphs and Some Applications -- Maximum Weight Independent Sets and Matchings in Sparse Random Graphs -- Estimating Frequency Moments of Data Streams Using Random Linear Combinations -- Fooling Parity Tests with Parity Gates -- Distribution-Free Connectivity Testing -- Testing the Independence Number of Hypergraphs -- A Note on Approximate Counting for k-DNF.