Before revision:  A key component for the algorithm is to find a single-tree {\em  O(1) cut approximator for outerplanar graphs.
After revision:  A key component for the algorithm is to find a {\em O(1) cut approximator for outerplanar graphs.