
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
The Workshop on Approximation and Online Algorithms (WAOA 2003) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications ar- ising from a variety of?elds. The workshop also covered experimental research on approximation and online algorithms. WAOA 2003 took place in Budapest, Hungary, from September 16 to September 18. The workshop was part of the ALGO 2003 event, which also hosted ESA 2003, WABI 2003, and ATMOS 2003. TopicsofinterestforWAOA2003were:competitiveanalysis,inapproximab- ilityresults,randomizationtechniques,approximationclasses,scheduling,coloring and partitioning, cuts and connectivity, packing and covering, geometric pr- lems, network design, and applications to game theory and?nancial problems. In response to our call for papers we received 41 submissions. Each submission was reviewed by at least 3 referees, who judged the papers on originality, quality, and consistency with the topics of the conference. Based on these reviews the program committee selected 19 papers for presentation at the workshop and for publication in this proceedings. This volume contains the 19 selected papers and 5 invited abstracts from an ARACNE minisymposium which took place as part of WAOA.
The Workshop on Approximation and Online Algorithms (WAOA 2003) convened to explore the design and analysis of algorithms for computationally challenging problems, particularly those encountered in online settings. The workshop, held in Budapest, Hungary, brought together researchers to discuss competitive analysis, inapproximability results, randomization techniques, and various applications. The proceedings include 19 selected papers from submissions reviewed for originality and quality, alongside 5 invited abstracts from an ARACNE minisymposium.
The proceedings from WAOA 2003 offer a snapshot of the research landscape in approximation and online algorithms as of 2003. The selection process, involving at least 3 referees per submission, suggests a focus on rigorous academic contributions. The inclusion of invited abstracts indicates an effort to broaden the scope beyond submitted papers, potentially highlighting emerging areas or interdisciplinary connections.
Page Count:
269
Publication Date:
2004-01-01
ISBN-10:
3540210792
ISBN-13:
9783540210795
No comments yet. Be the first to share your thoughts!