scientific article; zbMATH DE number 850316

MaRDI QIDQ4866340zbMATH OpenFDO

Authors Yuriy V. Shamardin

Publication date 17 March 1996

zbMATH Keywords

parametric family of approximation algorithmssubset-sum problemworst-case performance ratio

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Two linear approximation algorithms for the subset-sum problem
• Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
• Worst-case analysis of an approximation scheme for the subset-sum problem
• Worst-case analysis of the subset sum algorithm for bin packing.

Cited in

(12)

• Approximation schemes for the subset-sum problem: Survey and experimental analysis
• Worst-case analysis of an approximation scheme for the subset-sum problem
• Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
• Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
• Worst-case analysis of the subset sum algorithm for bin packing.
• Worst-case performance of the successive approximation algorithm for four identical knapsacks
• Worst-case and average-case analysis of an algorithm solving a generalized knapsack problem
• Worst-case analysis of the differencing method for the partition problem
• Worst case analysis of two heuristics for the set partitioning problem
• scientific article; zbMATH DE number 1094170 (Why is no real title available?)
• Beyond the Worst-Case Analysis of Algorithms
• New analytical results in 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 Q4866340)