000 | 03974nam a22005295i 4500 | ||
---|---|---|---|
001 | vtls000559782 | ||
003 | RU-ToGU | ||
005 | 20210922090144.0 | ||
007 | cr nn 008mamaa | ||
008 | 170212s2015 gw | s |||| 0|eng d | ||
020 |
_a9783319182636 _9978-3-319-18263-6 |
||
024 | 7 |
_a10.1007/978-3-319-18263-6 _2doi |
|
035 | _ato000559782 | ||
040 |
_aSpringer _cSpringer _dRU-ToGU |
||
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 _helectronic resource _b12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers / _cedited by Evripidis Bampis, Ola Svensson. |
260 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2015. |
||
300 |
_aX, 273 p. 29 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v8952 |
|
505 | 0 | _aImproved Approximations for the Max k-Colored Clustering Problem -- A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line -- Better Algorithms for Online Bin Stretching -- Online Colored Bin Packing -- Improved Bound for Online Square-into-Square Packing -- Improved Approximation Algorithm for Fault-Tolerant Facility Placement -- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem -- Online Multi-Coloring with Advice -- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points -- Energy-Efficient Algorithms for Non-pre-emptive Speed-Scaling -- Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage -- Linear-Time Approximation Algorithms for Unit Disk Graphs -- The Minimum Feasible Tileset Problem -- Online Ad Assignment with an Ad Exchange -- Minimum Linear Arrangement of Series-Parallel Graphs -- Online Dual Edge Coloring of Paths and Trees -- Online Packet Scheduling Under Adversarial Jamming -- Generalized Hypergraph Matching via Iterated Packing and Local Ratio -- Steiner Trees with Bounded RC-Delay -- Multiprocessor Jobs, Pre-emptive Schedules, and One-Competitive Online Algorithms -- Routing Under Uncertainty: The a priori Traveling Repairman Problem -- Primal-Dual Algorithms for Precedence Constrained Covering Problems. | |
520 | _aThis book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wrocław, Poland, in September 2014 as part of ALGO 2014. The 22 revised full papers presented were carefully reviewed and selected from 49 submissions. They cover a wide range of topics such as coloring and partitioning, competitive analysis, 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 |
_aComputer Science. _9155490 |
|
650 | 0 |
_aAlgorithms. _9304813 |
|
650 | 0 |
_aNumerical analysis. _9566288 |
|
650 | 0 |
_aComputer science _xMathematics. _9304486 |
|
650 | 1 | 4 |
_aComputer Science. _9155490 |
650 | 2 | 4 |
_aAlgorithm Analysis and Problem Complexity. _9303732 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _9304816 |
650 | 2 | 4 |
_aNumeric Computing. _9303733 |
650 | 2 | 4 |
_aAlgorithms. _9304813 |
700 | 1 |
_aBampis, Evripidis. _eeditor. _9323976 |
|
700 | 1 |
_aSvensson, Ola. _eeditor. _9467152 |
|
710 | 2 |
_aSpringerLink (Online service) _9143950 |
|
773 | 0 | _tSpringer eBooks | |
830 | 0 |
_aLecture Notes in Computer Science, _9279505 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-18263-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
999 | _c414969 |