LEADER 03909nam  22006495  450 
001 996466083503316
005 20230221190216.0
010   $a3-319-51741-4
024 7 $a10.1007/978-3-319-51741-4
035   $a(CKB)3710000001041233
035   $a(DE-He213)978-3-319-51741-4
035   $a(MiAaPQ)EBC5578991
035   $a(PPN)198340273
035   $a(EXLCZ)993710000001041233
100   $a20170106d2017      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aApproximation and Online Algorithms$b[electronic resource] $e14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25?26, 2016, Revised Selected Papers /$fedited by Klaus Jansen, Monaldo Mastrolilli
205   $a1st ed. 2017.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017.
215   $a1 online resource (XIV, 211 p. 23 illus.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10138
311   $a3-319-51740-6 
327   $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. .
330   $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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10138
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aArtificial intelligence?Data processing
606   $aNumerical analysis
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aData Science
606   $aNumerical Analysis
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aArtificial intelligence?Data processing.
615  0$aNumerical analysis.
615 14$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aData Science.
615 24$aNumerical Analysis.
676   $a005.1
702   $aJansen$b Klaus$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aMastrolilli$b Monaldo$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996466083503316
996   $aApproximation and Online Algorithms$92954916
997   $aUNISA