The Double Bubble problem is a generalization of the isoperimetric problem asking the following: given two volumes, what are the two shapes admitting these volumes with the smallest perimeter, where the perimeter of the joint boundary is counted once. We study the DB problem over the l_1 norm and show that one can approximate the solutions very well in the discrete lattice. I will also discuss solutions over other norms and their connection to the Euclidean solutions.