Before revision:   ]  Gawrychowski, Landau, Sung, and Weimann [ICALP'18] devise a greedy algorithm that runs in time O(n^{1.5}\log n) based on micro-macro decomposition .
After revision:  ] Gawrychowski, Landau, Sung, and Weimann [ICALP'18] devise a greedy algorithm that runs in time O(n^{1.5}\log n) .