TY - BOOK UR - http://lib.ugent.be/catalog/ebk01:3710000001041233 ID - ebk01:3710000001041233 LA - eng TI - Approximation and Online Algorithms 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers PY - 2017 SN - 9783319517414 AU - Jansen, Klaus. editor. AU - Mastrolilli, Monaldo. editor. AB - Approximation 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. . AB - This 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. ER -Download RIS file
03554nam a22005295i 4500 | |||
001 | 978-3-319-51741-4 | ||
003 | DE-He213 | ||
005 | 20170109111311.0 | ||
007 | cr nn 008mamaa | ||
008 | 170106s2017 gw | s |||| 0|eng d | ||
020 | a 9783319517414 9 978-3-319-51741-4 | ||
024 | 7 | a 10.1007/978-3-319-51741-4 2 doi | |
050 | 4 | a QA76.9.A43 | |
072 | 7 | a UMB 2 bicssc | |
072 | 7 | a COM051300 2 bisacsh | |
082 | 4 | a 005.1 2 23 | |
245 | 1 | a Approximation and Online Algorithms h [electronic resource] : b 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers / c edited by Klaus Jansen, Monaldo Mastrolilli. | |
264 | 1 | a Cham : b Springer International Publishing : b Imprint: Springer, c 2017. | |
300 | a XIV, 211 p. 23 illus. b online resource. | ||
336 | a text b txt 2 rdacontent | ||
337 | a computer b c 2 rdamedia | ||
338 | a online resource b cr 2 rdacarrier | ||
347 | a text file b PDF 2 rda | ||
490 | 1 | a Lecture Notes in Computer Science, x 0302-9743 ; v 10138 | |
505 | a Approximation 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 | a This 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 | a Computer science. | ||
650 | a Data structures (Computer science). | ||
650 | a Algorithms. | ||
650 | a Numerical analysis. | ||
650 | a Computer science x Mathematics. | ||
650 | 1 | 4 | a Computer Science. |
650 | 2 | 4 | a Algorithm Analysis and Problem Complexity. |
650 | 2 | 4 | a Discrete Mathematics in Computer Science. |
650 | 2 | 4 | a Data Structures. |
650 | 2 | 4 | a Algorithms. |
650 | 2 | 4 | a Numeric Computing. |
700 | 1 | a Jansen, Klaus. e editor. | |
700 | 1 | a Mastrolilli, Monaldo. e editor. | |
710 | 2 | a SpringerLink (Online service) | |
773 | t Springer eBooks | ||
776 | 8 | i Printed edition: z 9783319517407 | |
830 | a Lecture Notes in Computer Science, x 0302-9743 ; v 10138 | ||
856 | 4 | u http://dx.doi.org/10.1007/978-3-319-51741-4 | |
912 | a ZDB-2-SCS | ||
912 | a ZDB-2-LNC | ||
950 | a Computer Science (Springer-11645) |
All data below are available with an Open Data Commons Open Database License. You are free to copy, distribute and use the database; to produce works from the database; to modify, transform and build upon the database. As long as you attribute the data sets to the source, publish your adapted database with ODbL license, and keep the dataset open (don't use technical measures such as DRM to restrict access to the database).
The datasets are also available as weekly exports.