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

Given a point set P in 2D, the problem of finding the smallest set of unitdisks that cover all of P is NP-hard. We present a simple algorithm for thisproblem with an approximation factor of 25/6 in the Euclidean norm and 2 in themax norm, by restricting the disk centers to lie on parallel lines. The runtime and space of this algorithm is O(n log n) and O(n) respectively. Thisalgorithm extends to any Lp norm and is asymptotically faster than knownalternative approximation algorithms for the same approximation factor.

A fast 25/6-approximation for the minimum unit disk cover problem