Approximation and online algorithms : 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised selected papers / Klaus Jansen, Monaldo Mastrolilli (eds.).
By: (14th : WAOA (Workshop) (14th : 2016 : Århus, Denmark)
Contributor(s): Jansen, Klaus [editor.] | Mastrolilli, Monaldo [editor.]Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 10138.; LNCS sublibrary: Publisher: Cham, Switzerland : Springer, 2017Description: 1 online resource (xvi, 211 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783319517414; 3319517414Other title: WAOA 2016Subject(s): Online algorithms -- Congresses | Approximation algorithms -- Congresses | Discrete mathematics | Algorithms & data structures | Numerical analysis | Mathematical theory of computation | Computers -- Data Processing | Computers -- Data Modeling & Design | Computers -- Programming -- Algorithms | Approximation algorithms | Online algorithmsGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and author index.
Online resource; title from PDF title page (SpringerLink, viewed January 19, 2017).
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.
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.