Average case analysis of the set packing problem

MaRDI QIDQ2786903zbMATH OpenFDO

Authors Krzysztof Szkatula

Publication date 23 February 2016

Published in Control and Cybernetics (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 3943557
• scientific article; zbMATH DE number 4099049
• Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
• Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis
• Stochastic set packing problem

Cited in

(7)

• Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis
• Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
• scientific article; zbMATH DE number 3943557 (Why is no real title available?)
• scientific article; zbMATH DE number 1303568 (Why is no real title available?)
• Average-case analyses of first fit and random fit bin packing
• Stochastic set packing problem
• On a posterior evaluation of a simple greedy method for set packing

This page was built for publication: Average case analysis of the set packing problem

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