Subsettree: Subset Tree
Dan Shea;
- Publisher: Zenodo
Related identifiers:
<p>A heap-ordered tree structure consisting of n-length subsets of a set. Solutions for the subset sum problem exist in which min-heap trees may be wielded to order all subsets by their sum and then traversed appropriately. By applying a binary search on the list of all... View more
- Related Research Results (1) Inferred by OpenAIREpublicationSolving the Subset Sum Problem with Heap-Ordered Subset Trees (2015)73%
- Metrics