: We prove that the strong product G1 G2 of G1 and G2 is Z3-flow contractible if and only if G1 G2 is not T K2, where T is a tree (we call T K2 a K4-tree). It follows that G1 G2 ad...
Wilfried Imrich, Iztok Peterin, Simon Spacapan, Cu...
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
The maximum residual flow problem with one-arc destruction is shown to be solvable in strongly polynomial time in [Aneja et al., Networks, 38 (2001), 194-198.]. However the statu...
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
This paper investigates the complexity of the min-max and min-max regret versions of the s−t min cut and min cut problems. Even if the underlying problems are closely related and...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...