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

In the field of algorithmic analysis, one of the more well-known exercises isthe subset sum problem. That is, given a set of integers, determine whether oneor more integers in the set can sum to a target value. Aside from thebrute-force approach of verifying all combinations of integers, severalsolutions have been found, ranging from clever uses of various data structuresto computationally-efficient approximation solutions. In this paper, a uniqueapproach is discussed which builds upon the existing min-heap solution forpositive integers, introducing a tree-based data structure influenced by thebinomial heap. Termed the subset tree, this data structure solves the subsetsum problem for all integers in time $O(N^3k\log k)$, where $N$ is the lengthof the set and $k$ is the index of the list of subsets that is being searched.

Solving the Subset Sum Problem with Heap-Ordered Subset Trees