Approximation and Online Algorithms (vol. # 3351)
Publication year: 2005
ISBN: 978-3-540-31833-0
Internet Resource: Please Login to download book
The 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications arising from a variety of ?elds. The workshop was part of the ALGO 2004 event which also hosted ESA, WABI, IWPEC, and ATMOS. TopicsofinterestsforWAOA2004were:applicationstogametheory,appr- imation classes, coloring and partitioning, competitive analysis, computational ?nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems. on the reviews, This volume contains the 21 selected papers
Subject: Computer Science, algorithm analysis, algorithm design, algorithms, approximation algorithms, combinatorial optimization, computational graph theory, discrete mathematics, game theory, geometric algorithms, graph algorithms, network algorithms, online algorithms, optimization, randomized algorithms
