scientific article; zbMATH DE number 4149895

MaRDI QIDQ3479813zbMATH OpenFDO

Authors

Publication date 1990

zbMATH Keywords

linear time algorithmsubset sum problem

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Subset-sum problems with different summands: Computation
• scientific article; zbMATH DE number 176777
• A Fast Approximation Algorithm for the Subset-sum Problem
• Two linear approximation algorithms for the subset-sum problem
• An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem

Cited in

(14)

• Solving dense subset-sum problems by using analytical number theory
• Selection of a large sum-free subset in polynomial time
• Erratum to: ``New analytical results in subset-sum problem
• On variations of the subset sum problem
• On consecutive subset sums
• On the expressiveness of subset-sum representations
• Subset sum in the absence of concentration
• scientific article; zbMATH DE number 1058053 (Why is no real title available?)
• The interval subset sum problem
• An asymptotic formula for the cardinality of a difference subset of the multidimensional torus \(\mathbb{Z}_3^n\)
• Fast exact and approximate algorithms for k-partition and scheduling independent tasks
• Estimating the cardinality of a difference subset of the discrete multi-torus \(\mathbb Z_3^n\)
• Sums of lexicographically ordered sets
• Subset-sum problems with different summands: Computation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479813)