Skip to contentSkip to filters

We use cookies for analytics.

Workshop

Approximation Algorithms and the Hardness of Approximation

About

Researchers investigate how accurately efficient algorithms can approximate difficult optimisation problems. The meeting brings together approaches from combinatorial optimisation, hardness of approximation and proof complexity to identify where approximation guarantees can be improved or shown impossible.

Topics

Details

Location

Banff International Research Station, Banff, Alberta, Canada

Organisations

  • Banff International Research Station for Mathematical Innovation and Discovery

    Host