Approximation and online algorithms : 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019 : revised selected papers
Author(s)
Bibliographic Information
Approximation and online algorithms : 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019 : revised selected papers
(Lecture notes in computer science, 11926 . LNCS sublibrary ; SL 1 . Theoretical computer science and general issues)
Springer, c2020
Available at 3 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||11926200040113086
Note
Includes bibliographical references and index
Description and Table of Contents
Description
This book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019.
The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
Table of Contents
Graph Algorithms.- Inapproximability Results.- Network Design.- Design and Analysis of Approximation and Online Algorithms.- Parameterized Complexity.- Algorithmic Game Theory.- Algorithmic trading.- Competitive analysis.- Computational Advertising.- Computational finance.- Geometric problems.- Mechanism Design.
by "Nielsen BookData"