Stochastic analysis of greedy algorithms for the subset sum problem

DOI10.1246/CL.2007.732zbMath0941.90064OpenAlexW2951146621MaRDI QIDQ1806779

Ulrich Pferschy

Publication date: 8 November 1999

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1246/cl.2007.732

zbMATH Keywords

probabilistic analysissubset sum problemexpected solution value

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial probability (60C05)

Related Items (1)

Average-case performance of rollout algorithms for knapsack problems

This page was built for publication: Stochastic analysis of greedy algorithms for the subset sum problem