06071nam 22008055 450 99646538820331620200705230904.03-540-27821-410.1007/b99805(CKB)1000000000212503(SSID)ssj0000104941(PQKBManifestationID)11128569(PQKBTitleCode)TC0000104941(PQKBWorkID)10085692(PQKB)10519496(DE-He213)978-3-540-27821-4(MiAaPQ)EBC3088816(PPN)155228269(EXLCZ)99100000000021250320121227d2004 u| 0engurnn|008mamaatxtccrApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques[electronic resource] 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 Ron1st ed. 2004.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2004.1 online resource (X, 434 p.) Lecture Notes in Computer Science,0302-9743 ;3122Bibliographic Level Mode of Issuance: Monograph3-540-22894-2 Includes bibliographical references at the end of each chapters and index.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.Lecture Notes in Computer Science,0302-9743 ;3122ComputersComputer scienceAlgorithmsComputer science—MathematicsNumerical analysisTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Computer Science, generalhttps://scigraph.springernature.com/ontologies/product-market-codes/I00001Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Numeric Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I1701XAlgorithmshttps://scigraph.springernature.com/ontologies/product-market-codes/M14018Computers.Computer science.Algorithms.Computer science—Mathematics.Numerical analysis.Theory of Computation.Computer Science, general.Algorithm Analysis and Problem Complexity.Discrete Mathematics in Computer Science.Numeric Computing.Algorithms.004.0151Jansen Klausedthttp://id.loc.gov/vocabulary/relators/edtKhanna Sanjeevedthttp://id.loc.gov/vocabulary/relators/edtRolim José D. Pedthttp://id.loc.gov/vocabulary/relators/edtRon Danaedthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Approximation Algorithms for Combinatorial Optimization ProblemsMiAaPQMiAaPQMiAaPQBOOK996465388203316Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques772207UNISA