Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
In this paper two agglomerative learning algorithms based on new similarity measures defined for hyperbox fuzzy sets are proposed. They are presented in a context of clustering and...
—“A General Reflex Fuzzy Min-Max Neural Network” (GRFMN) is presented. GRFMN is capable to extract the underlying structure of the data by means of supervised, unsupervised a...