|
|
|
|
| LEADER |
04572nmm a2200433 u 4500 |
| 001 |
EB000656311 |
| 003 |
EBX01000000000000000509393 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540451983
|
| 100 |
1 |
|
|a Arora, Sanjeev
|e [editor]
|
| 245 |
0 |
0 |
|a Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
|h Elektronische Ressource
|b 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
|c edited by Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai
|
| 250 |
|
|
|a 1st ed. 2003
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2003, 2003
|
| 300 |
|
|
|a IX, 411 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 505 |
0 |
|
|a 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 --
|
| 505 |
0 |
|
|a 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 --
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Optimization
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Numerical Analysis
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Numerical analysis
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Mathematical optimization
|
| 700 |
1 |
|
|a Jansen, Klaus
|e [editor]
|
| 700 |
1 |
|
|a Rolim, Jose D.P.
|e [editor]
|
| 700 |
1 |
|
|a Sahai, Amit
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/b11961
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/b11961?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.1
|
| 520 |
|
|
|a 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
|