Factoring Polynomials with Rational Coefficients.
Fast approximation of centrality.
Fast approximation of minimum multicast congestion – Implementation versus theory
The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known -hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with edges and multicast requests, an -approximation can be computed in time, where bounds the time for computing an -approximate minimum Steiner tree. Moreover, we present a new fast heuristic that...
Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known NP-hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with m edges and k multicast requests, an r(1 + ε)(rOPT + exp(1)lnm)-approximation can be computed in O(kmε-2lnklnm) time, where β bounds the time for computing an r-approximate minimum Steiner tree. Moreover,...
Fast searching for Andrews-Curtis trivializations.
Faster backtracking algorithms for the generation of symmetry-invariant permutations.
Finding induced acyclic subgraphs in random digraphs.
Finely homogeneous computations in free Lie algebras.
Finite alogorithmic procedures and inductive definability.
Free associative algebras, noncommutative Gröbner bases, and universal associative envelopes for nonassociative structures
First, we provide an introduction to the theory and algorithms for noncommutative Gröbner bases for ideals in free associative algebras. Second, we explain how to construct universal associative envelopes for nonassociative structures defined by multilinear operations. Third, we extend the work of Elgendy (2012) for nonassociative structures on the 2-dimensional simple associative triple system to the 4- and 6-dimensional systems.
From classical numerical mathematics to scientific computing.
Further results on supernumary polylogarithmic ladders.
Fuzzy neural network approach to fuzzy polynomials.
In this paper, an architecture of fuzzy neural networks is proposed to find a real root of a dual fuzzy polynomial (if exists) by introducing a learning algorithm. We proposed a learning algorithm from the cost function for adjusting of crisp weights. According to fuzzy arithmetic, dual fuzzy polynomials can not be replaced by a fuzzy polynomials, directly. Finally, we illustrate our approach by numerical examples.
Fuzzy termination criteria in Knapsack Problem algorithms.
Fuzzy rule based termination criteria are introduced in two conventional and exact algorithms solving Knapsack Problems. As a consequence two new solution algorithms are obtained. These algorithms are heuristic ones with a high performance. The efficiency of the algorithms obtained is illustrated by solving some numerical examples.