Before revision:  We continue by investigating MAX-IS and provide a series of deterministic dynamic approximation schemes . For uniform rectangles, we first give an algorithm that maintains a 4-approximate MAX-IS with O(1) update time. In a subsequent algorithm, we establish the trade-off between approximation quality 2 (1+\frac{1{k}) and update time O(k^2\log n) for k\in \mathbb{N}.
After revision:  We continue by investigating MAX-IS and provide a series of deterministic dynamic approximation schemes with approximation factors between 2 (1+\frac{1{k}) and update time O(k^2\log n) for k\in \mathbb{N}.