| Vorliegende Sprache |
eng |
| ISBN |
978-3-319-51740-7 |
| Name |
Jansen, Klaus ¬[Hrsg.]¬ |
| Mastrolilli, Monaldo ¬[Hrsg.]¬ |
| Name ANZEIGE DER KETTE |
Mastrolilli, Monaldo ¬[Hrsg.]¬ |
| T I T E L |
Approximation and Online Algorithms |
| Zusatz zum Titel |
14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers |
| Verlagsort |
Cham |
| Verlag |
Springer |
| Erscheinungsjahr |
2017 |
| 2017 |
| Umfang |
Online-Ressource (XIV, 211 p. 23 illus, online resource) |
| Reihe |
Lecture Notes in Computer Science ; 10138 |
| Lecture notes in computer science |
| Band |
10138 |
| Titelhinweis |
Druckausg.ISBN: 978-3-319-51740-7 |
| Printed editionISBN: 978-3-319-51740-7 |
| ISBN |
ISBN 978-3-319-51741-4 |
| Klassifikation |
*68-06 |
| 68W25 |
| 68W27 |
| 00B25 |
| UMB |
| COM051300 |
| 005.1 |
| 518.1 |
| QA76.9.A43 |
| Kurzbeschreibung |
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 |
| 2. Kurzbeschreibung |
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 |
| 1. Schlagwortkette |
Approximationsalgorithmus |
| Online-Algorithmus |
| ANZEIGE DER KETTE |
Approximationsalgorithmus -- Online-Algorithmus |
| SWB-Titel-Idn |
484472674 |
| Signatur |
Springer E-Book |
| Bemerkungen |
Elektronischer Volltext - Campuslizenz |
| Elektronische Adresse |
$uhttp://dx.doi.org/10.1007/978-3-319-51741-4 |
| Internetseite / Link |
Volltext |
| Siehe auch |
Cover |
| Siehe auch |
Inhaltstext |
