Priority Algorithms for the Subset-Sum Problem

DOI10.1007/978-3-540-73545-8_49MaRDI QIDQ3608874zbMATH OpenOpenAlexFDO

Authors Yuli Ye, Allan Borodin

Publication date 6 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73545-8_49

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Approximation algorithms (68W25)

Recommendations

• Priority algorithms for the subset-sum problem
• Stochastic analysis of greedy algorithms for the subset sum problem
• Priority algorithms for makespan minimization in the subset model.
• scientific article; zbMATH DE number 1947045
• Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems

Cited in

(3)

• Priority algorithms for the subset-sum problem
• On Selecting a Subset Containing the Alternative with the Largest Priority
• Randomized priority algorithms

This page was built for publication: Priority Algorithms for the Subset-Sum Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608874)