We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
In this paper, we introduce a neural network -based decision table algorithm. We focus on the implementation details of the decision table algorithm when it is constructed using t...
: We concern ourselves with the situation Here we investigate an extension of the basic concept of in which we use the Dempster-Shafer belief structure to a compatibility relation ...
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...