scientific article; zbMATH DE number 176777

MaRDI QIDQ4036607zbMATHFDO

Authors Olded Margalit, Zvi Galil

Publication date 18 May 1993

zbMATH Keywords

almost linear-time algorithmdense subset-sum problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
• Solving dense subset-sum problems by using analytical number theory
• STACS 2005
• Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
• Improved low-density subset sum algorithms

Cited in

(15)

• An Average-Case Sublinear Exact Li and Stephens Forward Algorithm
• Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
• On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
• STACS 2005
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• Dense subset sum may be the hardest
• Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum
• Succinct Certificates for Almost All Subset Sum Problems
• Exact algorithms for problems related to the densest \(k\)-set problem
• scientific article; zbMATH DE number 139903 (Why is no real title available?)
• Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
• scientific article; zbMATH DE number 4149895 (Why is no real title available?)
• A branch bound method for subset sum problem

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 Q4036607)