Scope

Approximation and online algorithms are fundamental tools to deal with computationally hard problems and problems in which the input is gradually disclosed over time. Both kinds of problems arise from a large number of applications in a variety of fields. The workshop focuses on the design and analysis of approximation and online algorithms. It also covers experimental methods used to design and analyze efficient approximation and online algorithms. It is colocated with ALGO 2021, which also hosts ESA, ALGOCLOUD, ALGOSENSORS and ATMOS. ALGO 2021 will take place 6-10 September 2021 in Lisbon, Portugal.

Important Dates

        Paper Submission: June 27, 2021
        Notification of acceptance: July 31, 2021
        Camera ready: August 7, 2021
        Conference dates: September 9 - 10, 2021, in Lisbon, Portugal

Call For Papers

Submissions should start with the title of the paper, each author’s name, affiliation, and e-mail address, followed by a one- or two-paragraph summary of the results to be presented. This should then be followed by a technical exposition on single-spaced pages on letter-size paper, using reasonable margins, page numbers, and at least 11-point font. The first 10 pages should contain the main ideas and techniques used to achieve the results including motivation and a clear comparison with related work (not including the references). There is no page limit but any material beyond the first 10 pages will be read at the sole discretion of the program committee. Simultaneous submission to other conferences with published proceedings is not allowed. Submitted papers are not required to be in LNCS style style.

Papers should be submitted electronically via the EasyChair submission system at: https://easychair.org/conferences/?conf=waoa21

By submitting a paper the authors acknowledge that in case of acceptance at least one of the authors must register at ALGO 2021 and present the paper. The program committee may award a Best Paper Award to one of the accepted papers.

Topics

Papers are solicited in all research areas related to approximation and online algorithms, including, but not limited to:

    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
    Real-world applications