Worst-case analysis of an approximation scheme for the subset-sum problem

DOI10.1016/0167-6377(86)90065-9zbMath0618.90080OpenAlexW2055529705MaRDI QIDQ1089266

Matteo Fischetti

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90065-9

zbMATH Keywords

worst-case performancepolynomial approximation schemeSubset-Sum problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (2)

A polynomial approximation scheme for the subset sum problem ⋮ A new linear storage, polynomial-time approximation scheme for the subset-sum problem

Cites Work

• Worst-case analysis of greedy algorithms for the subset-sum problem
• Unnamed Item

This page was built for publication: Worst-case analysis of an approximation scheme for the subset-sum problem