In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
Abstract. Global integration and migration force people to learn additional languages. With respect to major languages, the acquisition is already initiated at primary school but a...
Oliver Jokisch, Uwe Koloska, Diane Hirschfeld, R&u...