An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2005.09.026 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2096100178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Variable Extremum Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and scalable parallel algorithms for knapsack-like problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Algorithm for the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel two-list algorithm for the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel permutation and sorting algorithms and a new generalized connection network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on parallel algorithms for the knapsack problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the subset sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839149 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2005.09.026 / rank
 
Normal rank

Latest revision as of 05:24, 10 December 2024

scientific article
Language Label Description Also known as
English
An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
scientific article

    Statements

    An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (English)
    0 references
    15 November 2006
    0 references
    subset-sum problem
    0 references
    Knapsack problem
    0 references
    parallel algorithms
    0 references
    PRAM machines
    0 references

    Identifiers