000 03933nam a22005895i 4500
001 978-3-319-51741-4
003 DE-He213
005 20240730192837.0
007 cr nn 008mamaa
008 170106s2017 sz | s |||| 0|eng d
020 _a9783319517414
_9978-3-319-51741-4
024 7 _a10.1007/978-3-319-51741-4
_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] :
_b14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers /
_cedited by Klaus Jansen, Monaldo Mastrolilli.
250 _a1st ed. 2017.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2017.
300 _aXIV, 211 p. 23 illus.
_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 ;
_v10138
505 0 _aApproximation Algorithms for the k-Set Packing Problem -- On Linear and Semidefinite Programs for Polytopes in Combinatorial Optimization -- The Shortest Separating Cycle Problem -- Dynamic Traveling Repair Problem with an Arbitrary Time Window -- A PTAS for the Cluster Editing Problem on Planar Graphs -- Bin Packing with Colocations -- Batch Coloring of Graphs -- New Integrality Gap Results for the Firefighters Problem on Trees -- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-Infinite Linear Programs -- Balanced Optimization with Vector Costs -- Vertex Sparsification in Trees -- Scenario Submodular Cover -- Non-Greedy Online Steiner Trees on Outerplanar Graphs -- A Refined Analysis of Online Path Coloring in Trees -- Resource Allocation Games with Multiple Resource Classes -- Tight Approximation Bounds for the Seminar Assignment Problem -- A Priori TSP in the Scenario Model -- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems. .
520 _aThis book constitutes the thoroughly refereed post-workshop proceedings of the 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, held in Aarhus, Denmark, in August 2016 as part of ALGO 2016. The 16 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 33 submissions. Topics of interest for WAOA 2016 were: 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 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aNumerical analysis.
_94603
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aData Science.
_934092
650 2 4 _aNumerical Analysis.
_94603
700 1 _aJansen, Klaus.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9151486
700 1 _aMastrolilli, Monaldo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9151487
710 2 _aSpringerLink (Online service)
_9151488
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319517407
776 0 8 _iPrinted edition:
_z9783319517421
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v10138
_9151489
856 4 0 _uhttps://doi.org/10.1007/978-3-319-51741-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94462
_d94462