LEADER 01154nam0-2200301 --450 001 9910496910203321 005 20250923094759.0 100 $a20211004d1907----kmuy0itay5050 ba 101 0 $aita 102 $aIT 105 $a 001yy 200 1 $aCome si coltiva il tabacco$eistruzioni pratiche per la coltivazione dei principali tipi di tabacco da fumo che possono avere importanza in Italia$fMichele Benincasa 210 $aRoma$cTip. Elzeviriana$d1907 215 $avoll.$cill.$d26 cm 300 $aIn testa ai front.: Ministero delle finanze, Direzione generale delle privative 327 0 $a1.: La coltivazione del tabacco nei suoi rapporti col Monopolio 610 0 $aTabacco$aColtivazione 676 $a338$v23$zita 700 1$aBenincasa,$bMichele$f$0840022 712 01$aItalia$b: Ministero delle Finanze$b: Direzione generale delle privative 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9910496910203321 952 $a60 DONO MATARAZZO 08$b506/2021$fFAGBC 952 $aA MUSA 1009$b03/4255/25$fFAGBC 959 $aFAGBC 996 $aCome si coltiva il tabacco$91875627 997 $aUNINA LEADER 04936nam 22008295 450 001 9910484454403321 005 20251226195229.0 010 $a3-540-93980-6 024 7 $a10.1007/978-3-540-93980-1 035 $a(CKB)1000000000548791 035 $a(SSID)ssj0000316306 035 $a(PQKBManifestationID)11205454 035 $a(PQKBTitleCode)TC0000316306 035 $a(PQKBWorkID)10275349 035 $a(PQKB)11680191 035 $a(DE-He213)978-3-540-93980-1 035 $a(MiAaPQ)EBC3063854 035 $a(PPN)13287072X 035 $a(EXLCZ)991000000000548791 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation and Online Algorithms $e6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, Revised Papers /$fedited by Evripidis Bampis, Martin Skutella 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (X, 293 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5426 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-93979-2 320 $aIncludes bibliographical references and index. 327 $aWAOA 2008 -- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees -- Size Versus Stability in the Marriage Problem -- Degree-Constrained Subgraph Problems: Hardness and Approximation Results -- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines -- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs -- Minimizing Average Flow Time on Unrelated Machines -- Cooperation in Multiorganization Matching -- Randomized Algorithms for Buffer Management with 2-Bounded Delay -- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints -- Malicious Bayesian Congestion Games -- Stackelberg Strategies and Collusion in Network Games with Splittable Flow -- Peak Shaving through Resource Buffering -- On Lagrangian Relaxation and Subset Selection Problems -- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements -- Caching Content under Digital Rights Management -- Reoptimization of Weighted Graph and Covering Problems -- Smoothing Imprecise 1.5D Terrains -- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs -- Dynamic Offline Conflict-Free Coloring for Unit Disks -- Experimental Analysis of Scheduling Algorithms for Aggregated Links -- A Approximation Algorithm for the Minimum Maximal Matching Problem -- On the Maximum Edge Coloring Problem. 330 $aThis book constitutes the thoroughly refereed post workshop proceedings of the 6th International Workshop on Approximation and Online Algorithms, WAOA 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 conference event. The 22 revised full papers presented were carefully reviewed and selected from 56 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5426 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aComputer graphics 606 $aArtificial intelligence$xData processing 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aComputer Graphics 606 $aData Science 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aComputer graphics. 615 0$aArtificial intelligence$xData processing. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aComputer Graphics. 615 24$aData Science. 676 $a005.1 686 $aDAT 530f$2stub 686 $aMAT 410f$2stub 686 $aMAT 652f$2stub 686 $aSS 4800$2rvk 701 $aSkutella$b Martin$0230000 701 $aBampis$b Evripidis$01754801 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484454403321 996 $aApproximation and Online Algorithms$94521604 997 $aUNINA