LEADER 01157nas--22004211i-450- 001 990006430780403321 011 $a0011-152X 035 $a000643078 035 $aFED01000643078 035 $a(Aleph)000643078FED01 035 $a000643078 100 $a20010131a1970----km-y0itay50------ba 101 0 $aita 102 $aIT 110 $aaga-------- 200 1 $aCritica marxista$erivista bimestrale 207 0$aA. I (1963)- 210 $aRoma$cEditori riuniti$d1970 215 $av.$d22 cm 300 $aDal 1992 nuova serie 304 $aDal 1992 compl. del tit.: analisi e contributi per ripensare la sinistra 305 $aDal 1993 ed.: Ciemme 307 $aDal 1992 il formato varia in 28 cm 326 $aBimestrale 421 1$1001000643105$12001$aCritica marxista. Quaderni 422 1$1001$12001 430 1$1001$12001 440 1$1001$12001 676 $a335.405 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aSE 912 $a990006430780403321 951 $aITA 356 959 $aPER 959 $aFLFBC 996 $aCritica marxista$9649868 997 $aUNINA 998 $aBiblioteca di Lettere e Filosofia: LEADER 05142nam 22006735 450 001 9910483161103321 005 20251226202719.0 024 7 $a10.1007/11538462 035 $a(CKB)1000000000213185 035 $a(SSID)ssj0000316309 035 $a(PQKBManifestationID)11205455 035 $a(PQKBTitleCode)TC0000316309 035 $a(PQKBWorkID)10275215 035 $a(PQKB)10975978 035 $a(DE-He213)978-3-540-31874-3 035 $a(MiAaPQ)EBC3067939 035 $a(PPN)123096766 035 $a(EXLCZ)991000000000213185 100 $a20100928d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques $e8th International Workshop on Approximation Algorithms for Compinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings /$fedited by Chandra Chekuri, Klaus Jansen, José D.P. Rolim, Luca Trevisan 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XI, 495 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3624 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-31874-7 311 08$a3-540-28239-4 320 $aIncludes bibliographical references and index. 327 $aContributed Talks of APPROX -- The Network as a Storage Device: Dynamic Routing with Bounded Buffers -- Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT -- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs -- A Rounding Algorithm for Approximating Minimum Manhattan Networks -- Packing Element-Disjoint Steiner Trees -- Approximating the Bandwidth of Caterpillars -- Where?s the Winner? Max-Finding and Sorting with Metric Costs -- What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization -- The Complexity of Making Unique Choices: Approximating 1-in-k SAT -- Approximating the Distortion -- Approximating the Best-Fit Tree Under L p Norms -- Beating a Random Assignment -- Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints -- Approximation Algorithms for Network Design and Facility Location with Service Capacities -- Finding Graph Matchings in Data Streams -- A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses -- Efficient Approximation of Convex Recolorings -- Approximation Algorithms for Requirement Cut on Graphs -- Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems -- Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy -- Contributed Talks of RANDOM -- Bounds for Error Reduction with Few Quantum Queries -- Sampling Bounds for Stochastic Optimization -- An Improved Analysis of Mergers -- Finding a Maximum Independent Set in a Sparse Random Graph -- On the Error Parameter of Dispersers -- Tolerant Locally Testable Codes -- A Lower Bound on List Size for List Decoding -- A Lower Bound for Distribution-Free Monotonicity Testing -- On Learning Random DNF Formulas Under the Uniform Distribution.-Derandomized Constructions of k-Wise (Almost) Independent Permutations -- Testing Periodicity -- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem -- The Online Clique Avoidance Game on Random Graphs -- A Generating Function Method for the Average-Case Analysis of DPLL -- A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas -- Mixing Points on a Circle -- Derandomized Squaring of Graphs -- Tight Bounds for String Reconstruction Using Substring Queries -- Reconstructive Dispersers and Hitting Set Generators -- The Tensor Product of Two Codes Is Not Necessarily Robustly Testable -- Fractional Decompositions of Dense Hypergraphs. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3624 606 $aAlgorithms 606 $aNumerical analysis 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aNumerical Analysis 606 $aDiscrete Mathematics in Computer Science 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 14$aAlgorithms. 615 24$aNumerical Analysis. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.1 701 $aChekuri$b Chandra$01754273 712 12$aInternational Workshop on Randomization and Computation$d(9th :$f2005 :$eBerkeley, Calif.) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483161103321 996 $aApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques$94520487 997 $aUNINA