Approximation and online algorithms[...
Clark Conference ((2005 :)

 

  • Approximation and online algorithms[electronic resource] :13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015 : revised selected papers /
  • 紀錄類型: 書目-語言資料,印刷品 : Monograph/item
    杜威分類號: 005.1
    書名/作者: Approximation and online algorithms : 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015 : revised selected papers // edited by Laura Sanita, Martin Skutella.
    其他題名: WAOA 2015
    其他作者: Sanita, Laura.
    團體作者: Clark Conference
    出版者: Cham : : Springer International Publishing :, 2015.
    面頁冊數: x, 209 p. : : ill., digital ;; 24 cm.
    Contained By: Springer eBooks
    標題: Online algorithms - Congresses.
    標題: Approximation algorithms - Congresses.
    標題: Computer Science.
    標題: Algorithm Analysis and Problem Complexity.
    標題: Discrete Mathematics in Computer Science.
    標題: Data Structures.
    標題: Algorithms.
    標題: Computation by Abstract Devices.
    標題: Numeric Computing.
    ISBN: 9783319286846
    ISBN: 9783319286839
    內容註: 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.
    摘要、提要註: 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.
    電子資源: http://dx.doi.org/10.1007/978-3-319-28684-6
評論
Export
取書館別
 
 
變更密碼
登入