Výsledky vyhledávání - "polynomial time \(\rho\)-approximation algorithm"

Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan Autor Xu, Dehua, Sun, Kaibiao, Li, Hongxing

“…We introduce and study a parallel machine scheduling problem with almost periodic maintenance activities. We say that the maintenance of a machine is ɛ -almost…”
Získat plný text

Open block scheduling in optical communication networks Autor Ageev, A.A., Fishkin, A.V., Kononov, A.V., Sevastyanov, S.V.

Získat plný text

The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems Autor Demange, Marc, Paschos, Vangelis Th

Získat plný text