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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We study output-sensitive algorithms and complexity for multiobjectivecombinatorial optimization problems. In this computational complexityframework, an algorithm for a general enumeration problem is regarded efficientif it is output-sensitive, i.e., its running time is bounded by a polynomial inthe input and the output size. We provide both practical examples of MOCOproblems for which such an efficient algorithm exists as well as problems forwhich no efficient algorithm exists under mild complexity theoreticassumptions.

Output-sensitive Complexity of Multiobjective Combinatorial Optimization