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 / / edited by Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
• Edizione: 1st ed. 2004.
• Descrizione fisica: 1 online resource (X, 434 p.)
• Disciplina: 004.0151
• Soggetto topico: Computer science; Algorithms; Computer science—Mathematics; Discrete mathematics; Numerical analysis; Theory of Computation; Computer Science; Discrete Mathematics in Computer Science; Numerical Analysis
• Persona (resp. second.): JansenKlaus; KhannaSanjeev; RolimJosé D. P; RonDana
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references at the end of each chapters and index.
• Nota di contenuto: 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.
• Sommario/riassunto: Thisvolumecontainsthepaperspresentedatthe7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2004) and the 8th International Workshop on Randomization and Compu- tion (RANDOM 2004), which took place concurrently at Harvard University, Cambridge, on August 22-24, 2004. APPROX focuses on algorithmic and c- plexity issues surrounding the development of e'cient approximate solutions to computationally hard problems, and this year's workshop was the seventh in the series after Aalborg (1998), Berkeley (1999), Saarbru ¨cken (2000), Berkeley (2001), Rome (2002), and Princeton (2003). RANDOM is concerned with app- cations of randomness to computational and combinatorial problems, and this year'sworkshopwasthe eighth in the seriesfollowing Bologna(1997),Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), and Princeton (2003). Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, inapproximability results, approximationclasses, - line problems, small space and data streaming algorithms, sub-linear time al- rithms, embeddings and metric space methods in approximation, math prog- ming in approximation algorithms, coloring and partitioning, cuts and conn- tivity, geometric problems, network design and routing, packing and covering, scheduling, game theory, design and analysis of randomized algorithms, r- domized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors,probabilistic proof systems,random projectionsand - beddings,error-correctingcodes,average-caseanalysis,propertytesting,com- tational learning theory, and other applications of approximation and rand- ness. The volumecontains19+18contributed papers,selected by the two program committees from 54+33 submissions received in response to the call for papers.
• Titolo autorizzato: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• ISBN: 3-540-27821-4
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910144161603321
• Lo trovi qui: Univ. Federico II
• Serie: Lecture Notes in Computer Science, . 1611-3349 ; ; 3122