arXiv subjects

Marek Kubale

Publications and source records attributed to Marek Kubale.

5 recordsLinked to original sources

arXiv2021

Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines

In this paper we consider the problem of scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. Our research stems from the work of Bodlaender et al.~[1992, 1993]. In particular, we pursue the line investigated partially by Mallek et al.~[2019], where the graph is complete multipartite so each machine can do jobs only from one partition. We also tie our results to the recent approach for so-called identical machines with class constraints by Jansen et al.~[2019], providing a link between our case and their generalization. In the paper we provide several algorithms constructing schedules, optimal or approximate with respect to the two most popular criteria of optimality: Cmax (the makespan) and ΣCj(the total completion time). We consider a variety of machine types in our paper: identical, uniform, unrelated, and a natural subcase of unrelated machines. Our results consist of delimitation of the easy (polynomial) and NP-hard problems within these constraints. In the case when the problem is hard, we also provide algorithm, either with a guaranteed constant worst-case approximation ratio or even in some cases a PTAS. In particular, we fill the gap on research for the problem of finding a schedule with smallest total completion time on uniform machines. We address this problem by developing a linear programming relaxation technique with an appropriate rounding, which to our knowledge is a novelty for this criterion in the considered setting.

cs.DS↗

arXiv2017

Equitable Colorings of $l$-Corona Products of Cubic Graphs

A graph $G$ is equitably $k$-colorable if its vertices can be partitioned into $k$ independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest integer $k$ for which such a coloring exists is known as the \emph{equitable chromatic number} of $G$ and it is denoted by $χ_{=}(G)$. In this paper the problem of determinig the value of equitable chromatic number for multicoronas of cubic graphs $G \circ^l H$ is studied. The problem of ordinary coloring of multicoronas of cubic graphs is solvable in polynomial time. The complexity of equitable coloring problem is an open question for these graphs. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use at most $χ_=(G \circ ^l H) + 1$ colors in the remaining cases.

cs.DM↗

arXiv2014

Equitable coloring of corona products of cubic graphs is harder than ordinary coloring

A graph is equitably $k$-colorable if its vertices can be partitioned into $k$ independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest $k$ for which such a coloring exists is known as the \emph{equitable chromatic number} of $G$ and it is denoted by $χ_{=}(G)$. In this paper the problem of determinig $χ_=$ for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas of cubic graphs is solvable in polynomial time, the problem of equitable coloring becomes NP-hard for these graphs. We provide polynomially solvable cases of coronas of cubic graphs and prove the NP-hardness in a general case. As a by-product we obtain a simple linear time algorithm for equitable coloring of such graphs which uses $χ_=(G)$ or $χ_=(G)+1$ colors. Our algorithm is best possible, unless $P=NP$. Consequently, cubical coronas seem to be the only known class of graphs for which equitable coloring is harder than ordinary coloring.

cs.DM↗

arXiv2014

On bipartization of cubic graphs by removal of an independent set

We study a new problem for cubic graphs: bipartization of a cubic graph $Q$ by deleting sufficiently large independent set $I$. It can be expressed as follows: \emph{Given a connected $n$-vertex tripartite cubic graph $Q=(V,E)$ with independence number $α(Q)$, does $Q$ contain an independent set $I$ of size $k$ such that $Q-I$ is bipartite?} We are interested for which value of $k$ the answer to this question is affirmative. We prove constructively that if $α(Q) \geq 4n/10$, then the answer is positive for each $k$ fulfilling $\lfloor (n-α(Q))/2 \rfloor \leq k \leq α(Q)$. It remains an open question if a similar construction is possible for cubic graphs with $α(Q)<4n/10$. Next, we show that this problem with $α(Q)\geq 4n/10$ and $k$ fulfilling inequalities $\lfloor n/3 \rfloor \leq k \leq α(Q)$ can be related to semi-equitable graph 3-coloring, where one color class is of size $k$, and the subgraph induced by the remaining vertices is equitably 2-colored. This means that $Q$ has a coloring of type $(k, \lceil(n-k)/2\rceil, \lfloor (n-k)/2 \rfloor)$.

cs.DM↗

arXiv2012

Equitable Colorings of Corona Multiproducts of Graphs

A graph is equitably $k$-colorable if its vertices can be partitioned into $k$ independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest $k$ for which such a coloring exists is known as the equitable chromatic number of $G$ and denoted $χ_{=}(G)$. It is known that this problem is NP-hard in general case and remains so for corona graphs. In "Equitable colorings of Cartesian products of graphs" (2012) Lin and Chang studied equitable coloring of Cartesian products of graphs. In this paper we consider the same model of coloring in the case of corona products of graphs. In particular, we obtain some results regarding the equitable chromatic number for $l$-corona product $G \circ ^l H$, where $G$ is an equitably 3- or 4-colorable graph and $H$ is an $r$-partite graph, a path, a cycle or a complete graph. Our proofs are constructive in that they lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of $G$. Moreover, we confirm Equitable Coloring Conjecture for corona products of such graphs. This paper extends our results from \cite{hf}.

cs.DM↗