A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem

DOI10.1016/0020-0190(92)90143-JzbMath0780.68045MaRDI QIDQ1198054

S. C. de Sarkar, U. K. Sarkar, Sujoy Ghose, Partha Pratim Chakrabarti

Publication date: 16 January 1993

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

zbMATH Keywords

approximation algorithm\(0/1\) knapsack problemNon-Increasing First Fit greedy algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

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

Cites Work

• Unnamed Item
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Approximate Algorithms for the 0/1 Knapsack Problem

This page was built for publication: A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem