LEADER 04142nam 2200613Ia 450 001 9910484454403321 005 20200520144314.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 $a20090112d2009 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aApproximation and oline agorithms $e6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, revised papers /$fEvripidis Bampis, Martin Skutella, editors 205 $a1st ed. 2009. 210 $aBerlin ;$aHeidelberg $cSpringer-Verlag$d2009 215 $a1 online resource (X, 293 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v5426 300 $aBibliographic Level Mode of Issuance: Monograph 311 $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$aLecture notes in computer science ;$v5426. 606 $aApproximation theory 606 $aAlgorithms 615 0$aApproximation theory. 615 0$aAlgorithms. 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 oline agorithms$94196980 997 $aUNINA