Paweł Obszarski - Profil naukowy - MOST Wiedzy

Wyszukiwarka

Media społecznościowe

Wybrane publikacje

  • A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints

    We address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Edge-coloring of 3-uniform hypergraphs

    We consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Equitable coloring of hypergraphs

    - DISCRETE APPLIED MATHEMATICS - Rok 2019

    A hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...

    Pełny tekst do pobrania w serwisie zewnętrznym

wyświetlono 627 razy