In this talk we introduce and analyze two overlapping Balancing Domain Decomposition algorithms. Per iteration, these preconditioners have one coarse problem (with sparse stencil and easy to build) and one Neumann local solver per overlapping subdomain (done in parallel). Analysis (we recover the small overlap optimal estimates) and numerical results will be presented.