Find the largest rectangle inscribed in a region partitionable into rectangles

Given a region that is partitionable into rectangles the sides of which lie horizontally or vertically, what is an run-time efficient algorithm that finds the largest inscribed rectangle the sides of which also lie horizontally or vertically?