 We also propose a simpler (1 + \epsilon)-approximate algorithm which runs in a factor of \log(c_{ \text{high }/(c_{ \text{low }\epsilon)) from linear time , but is faster in practice .
<fluency>  We also propose a simpler (1 + \epsilon)-approximate algorithm which runs in a factor of \log(c_{ \text{high }/(c_{ \text{low }\epsilon)) from linear time , but is faster in practice .
 We also propose a simpler (1 + \epsilon)-approximate algorithm which runs in a factor of \log(c_{ \text{high }/(c_{ low }\epsilon)) from linear time , but is faster in practice .