Description: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003.The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications. FORMAT Paperback LANGUAGE English CONDITION Brand New Publisher Description This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003.The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications. Table of Contents Contributed Talks of APPROX.- Correlation Clustering with Partial Information.- Improved Linear Time Approximation Algorithms for Weighted Matchings.- Covering Graphs Using Trees and Stars.- An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor.- Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.- Asymmetry in k-Center Variants.- An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.- On the Complexity of Approximating k-Dimensional Matching.- Approximating Market Equilibria.- Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.- On the Hardness of Approximate Multivariate Integration.- A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem.- Approximating Rooted Connectivity Augmentation Problems.- Effective Routing and Scheduling in Adversarial Queueing Networks.- Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement.- An Improved Algorithm for Approximating the Radii of Point Sets.- Contributed Talks of RANDOM.- Testing Low-Degree Polynomials over GF(2).- Computational Analogues of Entropy.- Bounds on 2-Query Codeword Testing.- The Lovász Number of Random Graphs.- Perfectly Balanced Allocation.- On Extracting Private Randomness over a Public Channel.- High Degree Vertices and Eigenvalues in the Preferential Attachment Graph.- The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems.- Continuous-Time Quantum Walks on the Symmetric Group.- Distribution-Free Property Testing.- On the Graph-Density of Random 0/1-Polytopes.- A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding.- Tight Bounds for Testing Bipartiteness in General Graphs.- Discrete Quantum WalksHit Exponentially Faster.- Approximate Testing of Visual Properties.- Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances.- A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. Promotional Springer Book Archives Feature Includes supplementary material: sn.pub/extras Details ISBN3540407707 Short Title APPROXIMATION RANDOMIZATION & Language English ISBN-10 3540407707 ISBN-13 9783540407706 Media Book Format Paperback DEWEY 004 Series Number 2764 Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K Place of Publication Berlin Country of Publication Germany Edited by Jose D.P. Rolim Affiliation Universite de Geneve Author Amit Sahai Pages 411 Edition 2003rd Illustrations IX, 411 p. Subtitle 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 24-26,2003 DOI 10.1007/b11961;10.1007/978-3-540-45198-3 Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Edition Description 2003 ed. Series Lecture Notes in Computer Science Year 2003 Publication Date 2003-08-13 Audience General We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:158853710;
Price: 154.34 AUD
Location: Melbourne
End Time: 2024-11-05T08:50:02.000Z
Shipping Cost: N/A AUD
Product Images
Item Specifics
Restocking fee: No
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 30 Days
ISBN-13: 9783540407706
Book Title: Approximation, Randomization, and Combinatorial Optimization. Alg
Number of Pages: 411 Pages
Language: English
Publication Name: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeto, NY, USA, August 24-26,2003
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Publication Year: 2003
Subject: Computer Science, Mathematics
Item Height: 233 mm
Item Weight: 1310 g
Type: Textbook
Author: Klaus Jansen, Jose D.P. Rolim, Amit Sahai, Sanjeev Arora
Item Width: 155 mm
Format: Paperback
