Recommendations
Cites work
- Approximating min sum set cover
- Approximation algorithms for combinatorial problems
- Bin packing can be solved within 1+epsilon in linear time
- Database Theory - ICDT 2005
- Minimum Weighted Sum Bin Packing
- On the ratio of optimal integral and fractional covers
- Weighted sum coloring in batch scheduling of conflicting jobs
Cited in
(3)
This page was built for publication: Min-sum bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721936)