Approximation Scheme for Packing Coloring In this we look into an approximation scheme for packing coloring problem on a complete / full $x$-ary tree (acyclic undirected unweighted graph). Analysis of this algorithm will be added later.