LEADER 06779nam 22008175 450 001 996466075503316 005 20230222103731.0 010 $a3-540-85363-4 024 7 $a10.1007/978-3-540-85363-3 035 $a(CKB)1000000000490330 035 $a(SSID)ssj0000355440 035 $a(PQKBManifestationID)11267512 035 $a(PQKBTitleCode)TC0000355440 035 $a(PQKBWorkID)10340359 035 $a(PQKB)11488305 035 $a(DE-He213)978-3-540-85363-3 035 $a(MiAaPQ)EBC3063505 035 $a(MiAaPQ)EBC6511698 035 $a(Au-PeEL)EBL6511698 035 $a(OCoLC)1166066489 035 $a(PPN)128126116 035 $a(EXLCZ)991000000000490330 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques$b[electronic resource] $e11th International Workshop, APPROX 2008 and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008 /$fedited by Ashish Goel, Klaus Jansen, José Rolim, Ronitt Rubinfeld 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XII, 604 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5171 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-85362-6 320 $aIncludes bibliographical references and index. 327 $aContributed Talks of APPROX -- Approximating Optimal Binary Decision Trees -- Santa Claus Meets Hypergraph Matchings -- Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction -- Connected Vertex Covers in Dense Graphs -- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies -- Sweeping Points -- Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness -- Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks -- Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP -- Approximating Maximum Subgraphs without Short Cycles -- Deterministic 7/8-Approximation for the Metric Maximum TSP -- Inapproximability of Survivable Networks -- Approximating Single Machine Scheduling with Scenarios -- Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity -- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One -- The Directed Minimum Latency Problem -- A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem -- Approximating Directed Weighted-Degree Constrained Networks -- A Constant Factor Approximation for Minimum ?-Edge-Connected k-Subgraph with Metric Costs -- Budgeted Allocations in the Full-Information Setting -- Contributed Talks of RANDOM -- Optimal Random Matchings on Trees and Applications -- Small Sample Spaces Cannot Fool Low Degree Polynomials -- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size -- Tensor Products of Weakly Smooth Codes Are Robust -- On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs -- Improved Bounds for Testing Juntas -- The Complexity of Distinguishing Markov Random Fields -- Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms -- Tight Bounds for Hashing Block Sources -- Improved Separations between Nondeterministic and Randomized Multiparty Communication -- Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs -- On the Query Complexity of Testing Orientations for Being Eulerian -- Approximately Counting Embeddings into Random Graphs -- Increasing the Output Length of Zero-Error Dispersers -- Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals -- The Complexity of Local List Decoding -- Limitations of Hardness vs. Randomness under Uniform Reductions -- Learning Random Monotone DNF -- Breaking the ?-Soundness Bound of the Linearity Test over GF(2) -- Dense Fast Random Projections and Lean Walsh Transforms -- Near Optimal Dimensionality Reductions That Preserve Volumes -- Sampling Hypersurfaces through Diffusion -- A 2-Source Almost-Extractor for Linear Entropy -- Extractors for Three Uneven-Length Sources -- The Power of Choice in a Generalized Pólya Urn Model -- Corruption and Recovery-Efficient Locally Decodable Codes -- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets. 330 $aThis book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. The 20 revised full papers of the APPROX 2008 workshop were carefully reviewed and selected from 42 submissions and focus on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM 2008 is concerned with applications of randomness to computational and combinatorial problems and accounts for 27 revised full papers, also diligently reviewed and selected out of 52 workshop submissions. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5171 606 $aComputer programming 606 $aComputer science 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aProgramming Techniques 606 $aTheory of Computation 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 615 0$aComputer programming. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 14$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 676 $a004 702 $aGoel$b Ashish 712 12$aInternational Workshop on Randomization and Computation$d(12th :$f2008 :$eBoston, Mass.) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466075503316 996 $aApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques$9772207 997 $aUNISA LEADER 01983nam0 2200457 i 450 001 VAN00127249 005 20240806100823.612 017 70$2N$a9788847039858 100 $a20200303d2019 |0itac50 ba 101 $aita 102 $aIT 105 $a|||| ||||| 200 1 $aMeccanica dei Continui$fSandra Forte, Luigi Preziosi, Maurizio Vianello 210 $aMilano$cSpringer$d2019 215 $axii, 486 p.$cill.$d24 cm 410 1$1001VAN00104561$12001 $aUnitext. La matematica per il 3+2$1210 $aMilano [etc.]$cSpringer$d1988-$v114 500 1$3VAN00237060$aMeccanica dei Continui$91733820 606 $a00A79 (77-XX)$xPhysics [MSC 2020]$3VANC023182$2MF 606 $a74-XX$xMechanics of deformable solids [MSC 2020]$3VANC022466$2MF 606 $a74Bxx$xElastic materials [MSC 2020]$3VANC023433$2MF 606 $a76-XX$xFluid mechanics [MSC 2020]$3VANC019858$2MF 606 $a76A02$xFoundations of fluid mechanics [MSC 2020]$3VANC021370$2MF 610 $aAerodinamica$9KW:K 610 $aContinuum Mechanics$9KW:K 610 $aFisica Matematica$9KW:K 610 $aFluid mechanics$9KW:K 610 $aMatematica applicata$9KW:K 610 $aSolid mechanics$9KW:K 620 $dMilano$3VANL000284 700 1$aForte$bSandra$3VANV098684$0781826 701 1$aPreziosi$bLuigi$3VANV039094$032041 701 1$aVianello$bMaurizio$3VANV098685$0294567 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20250131$gRICA 856 4 $uhttp://doi.org/10.1007/978-88-470-3985-8$zE-book ? Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o Shibboleth 899 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$1IT-CE0120$2VAN08 912 $fN 912 $aVAN00127249 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08DLOAD e-book 1804 $e08eMF1804 20200303 996 $aMeccanica dei Continui$91733820 997 $aUNICAMPANIA