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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study the optimization problem of choosing strings of finite length tomaximize string submodular functions on string matroids, which is a broaderclass of problems than maximizing set submodular functions on set matroids. Weprovide a lower bound for the performance of the greedy algorithm in ourproblem, and then prove that our bound is superior to the greedy curvaturebound of Conforti and Cornuejols. Our bound has lower computational complexitythan most previously proposed curvature bounds. Finally, we demonstrate thestrength of our result on a sensor coverage problem.

An Improved Greedy Curvature Bound in Finite-Horizon String Optimization with Application to a Sensor Coverage Problem