Approximation and Online Algorithms
Springer International Publishing (Verlag)
978-3-319-28683-9 (ISBN)
This book constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Approximation and Online Algorithms, WAOA 2015, held in Patras, Greece, in September 2015 as part of ALGO 2015.
The 17 revised full papers presented were carefully reviewed and selected from 40 submissions. Topics of interest for WAOA 2015 were: algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, scheduling problems,and real-world applications.
Algorithmic game theory.- Algorithmic trading.- Coloring and partitioning.- Competitive analysis.- Computational advertising.- Computational finance.- Cuts and connectivity.- Geometric problems.- Graph algorithms.- Inapproximability.- Mechanism design.- Natural algorithms.- Network design.- Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications.
| Erscheinungsdatum | 08.10.2016 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
| Zusatzinfo | X, 209 p. 24 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm Analysis • Algorithm analysis and problem complexity • algorithms • approximation algorithms • Coloring • competitive analysis • Computer Science • design and analysis of algorithms • Discrete mathematics in computer science • Fixed-parameter tractable algorithm • Geometric problems • network design • numeric computing • online algorithms • Online scheduling • Packing and Covering • parameterized complexity • problem complexity • Random input • Randomization techniques • Temporal connectivity • Temporal graphs |
| ISBN-10 | 3-319-28683-8 / 3319286838 |
| ISBN-13 | 978-3-319-28683-9 / 9783319286839 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
