Bin Packing NP Hard Proof via Reduction 🧩
Demonstrates that 1D Bin Packing is NP Hard by reducing from the Partition problem, a special case of Subset Sum.
Pranav
60 views • Nov 20, 2025
About this video
In this video, I prove the that 1 Dimensional Bin Packing problem is NP Hard by reducing it from the Subset Sum problem's special case which is the Partition Problem.
I also establish an inapproximability lower bound for APTAS.
I also establish an inapproximability lower bound for APTAS.
Video Information
Views
60
Likes
3
Duration
2:49
Published
Nov 20, 2025
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.