000 04342nam a22005775i 4500
001 978-3-642-38016-7
003 DE-He213
005 20160624102226.0
007 cr nn 008mamaa
008 130426s2013 gw | s |||| 0|eng d
020 _a9783642380167
_9978-3-642-38016-7
024 7 _a10.1007/978-3-642-38016-7
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aApproximation and Online Algorithms
_h[electronic resource] :
_b10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers /
_cedited by Thomas Erlebach, Giuseppe Persiano.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXII, 299 p. 39 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7846
505 0 _aInvited Contribution -- The Primal-Dual Approach for Online Algorithms -- Session 1: Graphs and Networks -- Independent Set with Advice: The Impact of Graph Knowledge -- Online Multi-Commodity Flow with High Demands -- Approximating Spanning Trees with Few Branches -- On the Complexity of the Regenerator Location Problem – Treewidth and Other Parameters -- Session 2: Geometric Problems -- Online Exploration of Polygons with Holes -- Probabilistic k-Median Clustering in Data Streams -- Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs -- On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods -- Session 3: Online Algorithms -- Asymptotically Optimal Online Page Migration on Three Points -- R–LINE: A Better Randomized 2-Server Algorithm on the Line -- Black and White Bin Packing -- Minimizing Cache Usage in Paging -- Session 4: Scheduling.Competitive-Ratio Approximation Schemes for Makespan Scheduling Problems -- Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling -- Approximating the Throughput by Coolest First Scheduling -- Algorithms for Cost-Aware Scheduling -- Session 5: Algorithmic Game Theory -- A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games -- Some Anomalies of Farsighted Strategic Behavior -- Session 6: Approximation Algorithms Scheduling with an Orthogonal Resource Constraint -- Improved Approximation Guarantees for Lower-Bounded Facility Location -- A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs -- Approximation Algorithms for the Wafer to Wafer Integration Problem.
520 _aThis book constitutes the thoroughly refereed post workshop proceedings of the 10th International Workshop on Approximation and Online Algorithms, WAOA 2012, held in Ljubljana, Slovenia, in September 2012 as part of the ALGO 2012 conference event. The 22 revised full papers presented together with invited talk were carefully reviewed and selected from 60 submissions. The workshop covered areas such as geometric problems, online algorithms, scheduling, algorithmic game theory, and approximation algorithms.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aElectronic data processing.
650 0 _aComputational complexity.
650 0 _aComputer graphics.
650 0 _aAlgorithms.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aNumeric Computing.
650 2 4 _aComputer Graphics.
650 2 4 _aInformation Systems Applications (incl. Internet).
650 2 4 _aAlgorithms.
700 1 _aErlebach, Thomas.
_eeditor.
700 1 _aPersiano, Giuseppe.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642380150
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7846
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-38016-7
942 _2EBK10810
_cEBK
999 _c40104
_d40104