<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Algorithms on Priyanshu Debnath</title><link>https://priyanshudebnath.me/tags/algorithms/</link><description>Recent content in Algorithms on Priyanshu Debnath</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Tue, 07 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://priyanshudebnath.me/tags/algorithms/feed.xml" rel="self" type="application/rss+xml"/><item><title>Bin Packing — Why It's Hard, How to Approximate It, and When It Isn't Hard At All</title><link>https://priyanshudebnath.me/posts/bin-packing-np-hardness-approximation-algorithms/</link><pubDate>Tue, 07 Jul 2026 00:00:00 +0000</pubDate><guid>https://priyanshudebnath.me/posts/bin-packing-np-hardness-approximation-algorithms/</guid><description>A full pass through bin packing — the formal problem, why the decision version is NP-complete (and why the optimization version is strongly so), every classical approximation algorithm with its proven bound, the special cases that collapse back to polynomial time, and the backtracking/bitmask-DP techniques you&amp;#39;d actually use to solve small instances in a contest.</description></item></channel></rss>