-
The complexity of Bottleneck Labeled Graph Problems
In the present paper, we study bottleneck labeled optimization problems arising in the context of graph theory. This long-established model partitions the set of edges... -
Optimization problems with propagation in graphs : Parameterized complexity a...
In this thesis, we investigate the computational complexity of optimization problems involving a “diffusion process” in a graph. More specifically, we are first... -
On the max-weight edge coloring problem
We study the following generalization of the classical edge coloring problem: Given a weighted graph, find a partition of its edges into matchings (colors), each one... -
Simple and fast reoptimizations for the Steiner tree problem
We address reoptimization issues for the Steiner tree problem. We assume that an optimal solution is given for some instance of the problem and the objective is to... -
Approximation algorithms for inventory control models
Inventory management has always been a major component of the field of operations research and numerous models derived from the industry aroused the interest of both...
