We study two generalizations of classic clustering problems called dynamic ordered k-median and k-supplier, where the points that need evolve over time, we are allowed to move cluster centers between consecutive time steps. In these problems, general goal is minimize certain combinations service cost movement centers, or one subject some constraints on other. obtain a constant-factor approximat...