Before revision:  Our exact algorithm runs in linear time when K^2 is O(N^C) for C < 1. Our (1 + \epsilon)-approximate algorithm runs in linear time when K\log(c_{ high }/(c_{ low }\epsilon)) is O(N^C) for C < 1, where c_{ high } and c_{ low } are upper and lower bounds on the optimal cost.
After revision:  Our exact algorithm runs in linear time when K^2 is O(N^C) for C < 1. Our (1 + \epsilon)-approximate algorithm runs in linear time when K\log(c_{ \text{high }/(c_{ low }\epsilon)) is O(N^C) for C < 1, where c_{ high } and c_{ low } are upper and lower bounds on the optimal cost.