LEADER 00923nam0-2200337---450- 001 990009402050403321 005 20111005151425.0 035 $a000940205 035 $aFED01000940205 035 $a(Aleph)000940205FED01 035 $a000940205 100 $a20110721d1967----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $aa-------001yy 200 1 $aCompendio di citologia e istologia$fSilvano Leghissa 205 $aRist. riveduta della 1. ed. 210 $aTorino$cUtet$dstampa 1967 215 $axi, 696 p.$cill.$d25 cm 610 0 $aCitologia$aIstologia 676 $a611.018 700 1$aLeghissa,$bSilvano$069867 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990009402050403321 952 $aIIId C 242$b8566$fDMVSF 952 $a56 D 7$bs.i.$fDMVAP 959 $aDMVSF 959 $aDMVAP 996 $aCompendio di citologia e istologia$9367214 997 $aUNINA LEADER 05845nam 22008055 450 001 996466153003316 005 20230406052948.0 010 $a3-540-32208-6 024 7 $a10.1007/11671411 035 $a(CKB)1000000000232814 035 $a(SSID)ssj0000316308 035 $a(PQKBManifestationID)11246733 035 $a(PQKBTitleCode)TC0000316308 035 $a(PQKBWorkID)10264022 035 $a(PQKB)11360905 035 $a(DE-He213)978-3-540-32208-5 035 $a(MiAaPQ)EBC3067821 035 $a(PPN)123131391 035 $a(EXLCZ)991000000000232814 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aApproximation and Online Algorithms$b[electronic resource] $eThird International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Selected Papers /$fedited by Thomas Erlebach, Giuseppe Persiano 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (X, 349 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3879 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-32207-8 320 $aIncludes bibliographical references and index. 327 $a?Almost Stable? Matchings in the Roommates Problem -- On the Minimum Load Coloring Problem -- Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT -- The Hardness of Network Design for Unsplittable Flow with Selfish Users -- Improved Approximation Algorithm for Convex Recoloring of Trees -- Exploiting Locality: Approximating Sorting Buffers -- Approximate Fair Cost Allocation in Metric Traveling Salesman Games -- Rounding of Sequences and Matrices, with Applications -- A Note on Semi-online Machine Covering -- SONET ADMs Minimization with Divisible Paths -- The Conference Call Search Problem in Wireless Networks -- Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents -- Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost -- A Better-Than-Greedy Algorithm for k-Set Multicover -- Deterministic Online Optical Call Admission Revisited -- Scheduling Parallel Jobs with Linear Speedup -- Online Removable Square Packing -- The Online Target Date Assignment Problem -- Approximation and Complexity of k?Splittable Flows -- On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem -- Tighter Approximations for Maximum Induced Matchings in Regular Graphs -- On Approximating Restricted Cycle Covers -- A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs -- Speed Scaling of Tasks with Precedence Constraints -- Partial Multicuts in Trees -- Approximation Schemes for Packing with Item Fragmentation. 330 $aThe third Workshop on Approximation and Online Algorithms (WAOA 2005) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of ?elds. WAOA 2005 took place in Palma de Mallorca, Spain, on 6?7 October 2005. The workshop was part of the ALGO 2005 event that also hosted ESA, WABI, and ATMOS. The two previous WAOA workshops were held in Budapest (2003) and Rome (2004). Topics of interest for WAOA 2005 were: algorithmic game theory, appro- mation classes, coloring and partitioning, competitive analysis, computational ?nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms, rand- izationtechniques,real-worldapplications,andschedulingproblems.Inresponse to the call for papers we received 68 submissions. Each submission was reviewed by at least three referees, and the vast majority by at least four referees. The submissions were mainly judged on originality, technical quality, and relevance to the topics of the conference. Based on the reviews, the Program Committee selected 26 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system,whichwasusedtomanagetheelectronicsubmissions,thereviewprocess, and the electronic PC meeting. It made our task much easier. We would also like to thank all the authors who submitted papers to WAOA 2005 as well as the local organizers of ALGO 2005. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3879 606 $aSoftware engineering 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aComputer graphics 606 $aArtificial intelligence?Data processing 606 $aSoftware Engineering 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aComputer Graphics 606 $aData Science 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aComputer graphics. 615 0$aArtificial intelligence?Data processing. 615 14$aSoftware Engineering. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aComputer Graphics. 615 24$aData Science. 676 $a005.1 702 $aErlebach$b Thomas$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPersiano$b Giuseppe$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aSpringerLink (Online service) 906 $aBOOK 912 $a996466153003316 996 $aApproximation and Online Algorithms$92954916 997 $aUNISA