We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Evolutionary multi-objective optimization deals with the task of computing a minimal set of search points according to a given set of objective functions. The task has been made e...
Rudolf Berghammer, Tobias Friedrich, Frank Neumann
We argue that certain theoretical commitments that underpin much existing Interorganisational Information Systems (IOIS) research at small scales become untenable when IOIS are st...
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Abstract--This correspondence revisits the joint transceiver optimization problem for multiple-input multiple-output (MIMO) channels. The linear transceiver as well as the transcei...