A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem

DOI10.1016/0020-0190(92)90089-EzbMath0793.90040MaRDI QIDQ1208445

Paolo Toth, Silvano Martello

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmgreedy algorithmsworst-case boundsubset-sum problem0/1 knapsack problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)

Related Items (2)

An approximate binary search algorithm for the multiple-choice knapsack problem ⋮ A Fast Approximation Algorithm For The Subset-Sum Problem

Cites Work

• Unnamed Item
• A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem
• Worst-case analysis of greedy algorithms for the subset-sum problem
• An Algorithm for Large Zero-One Knapsack Problems

This page was built for publication: A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem