English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The eleventh Workshop on Approximation and Online Algorithms (WAOA) was part of the federated ALGO conferences, and was held September 5 and 6, 2013, in Sophia Antipolis, France. The field of approximation algorithms studies how closely we can approximate optimal solutions to problems that are known to be computationally hard to solve exactly. The field of online algorithms studies how closely we can approximate optimal solutions to problems where the algorithm must make decisions before all the necessary information is available. Although the difficulties arise from different sources, computational hardness vs. lack of information, these fields share many common techniques, most notably the use of worst-case relative error to measure the goodness of an algorithm. The purpose of this special issue is to provide a snapshot of the state of current research in approximation and online algorithms. The nine papers in this special issue were selected for invitation by the program committee of WAOA. The papers underwent the normal reviewing process for Theory of Computing Systems. We now briefly introduce and describe the approximation and online papers separately.

Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms