000 04509nam a22006135i 4500
001 978-3-540-93980-1
003 DE-He213
005 20240423125852.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783540939801
_9978-3-540-93980-1
024 7 _a10.1007/978-3-540-93980-1
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aApproximation and Online Algorithms
_h[electronic resource] :
_b6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008, Revised Papers /
_cedited by Evripidis Bampis, Martin Skutella.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aX, 293 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5426
505 0 _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.
520 _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.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aNumerical analysis.
650 0 _aComputer graphics.
650 0 _aArtificial intelligence
_xData processing.
650 1 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aNumerical Analysis.
650 2 4 _aComputer Graphics.
650 2 4 _aData Science.
700 1 _aBampis, Evripidis.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSkutella, Martin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540939795
776 0 8 _iPrinted edition:
_z9783540939818
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5426
856 4 0 _uhttps://doi.org/10.1007/978-3-540-93980-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c182559
_d182559