Faster algorithms for \(k\)-subset sum and variations (Q2105266): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4311064408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SETH-based Lower Bounds for Subset Sum and Bicriteria Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating subset sum ratio via subset sum computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for \(k\)-\textsc{Subset Sum} and variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding witnesses by peeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation algorithms for the subset-sums equality problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the multiple subset sum problem with different knapsack capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3/4-approximation algorithm for multiple subset sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3181697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical models and decomposition methods for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Pseudopolynomial Time Algorithms for Subset Sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster FPTAS for the subset-sums ratio problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5075820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple FPTAS for the subset-sums ratio problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Knapsack Problems with Bounded Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Multi-Way Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equal-subset-sum problem / rank
 
Normal rank

Latest revision as of 00:49, 31 July 2024

scientific article
Language Label Description Also known as
English
Faster algorithms for \(k\)-subset sum and variations
scientific article

    Statements

    Faster algorithms for \(k\)-subset sum and variations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2022
    0 references
    color coding
    0 references
    FFT
    0 references
    \(k\)-subset sum
    0 references
    multiple knapsack
    0 references
    multiple subset sum
    0 references
    pseudopolynomial algorithms
    0 references
    subset sum
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers